![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
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.
Keywords
Finite Automata, Input Characters, Palindrome, String Length, Turing Machine.
User
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 248
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0