Total views : 301602
A Novel Approach to Design the Finite Automata to Accept the Palindrome with the Three Input Characters
Background/Objectives: In this paper we discuss that, how Finite Automata can accept the palindrome statically. Methods/Statistical Analysis: The formula 30+31+32+…+3n used to derive the possible strings. Where 3 represents input character and n represents maximum length of the string. Here the value of n taken as 5. Findings: The formula 2*31+2*32+1*33 used to derive palindrome from the possible strings. Application/Improvements: This method shows the extended use of Finite Automata as compared with the Turing Machine.
Finite Automata, Input Characters, Palindrome, String Length, Turing Machine.
- Ezhilarasu P, Thirunavukkarasu E, Karuppusami G, Krishnaraj N. Single substring based classification for nondeterministic finite automata. International Journal on Applications in Information and Communication Engineering. 2015; 1(10):29–31.
- Ezhilarasu P, Krishnaraj N. Double Substring Based Classification for Nondeterministic Finite Automata. International Conference on Recent Advances in Engineering, Science and Technology – ICON’15. Noorul Islam University, 2015. p. 104–7.
- Ezhilarasu P, Krishnaraj N. Triple Substring Based Classification for Nondeterministic Finite Automata. IJAER. 2015; 10(59):177–82.
- Available from: https://en.wikipedia.org/wiki/ Turing_machine.
- Martin JC. Introduction to languages and the theory of computation. 3rd ed. Tata Mcgraw Hill; 2010.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.