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 3 0 +3 1 +3 2 +…+3 n 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*3 1 +2*3 2 +1*3 3 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.