Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

A Novel Approach to Design the Finite Automata to Accept the Palindrome with the Three Input Characters


Affiliations
1 Department of Computer Science and Engineering, Hindusthan College of Engineering and Technology, Coimbatore - 641032, Tamil Nadu, India
2 Department of Information Technology, Valliammai Engineering College, Kattankulathur, Chennai - 603203, Tamil Nadu, India
3 Department of Electronics and Communication Engineering, Hindusthan Institute of Technology, Coimbatore - 641032, Tamil Nadu, India
4 Department of Mechatronics Engineering, Hindusthan College of Engineering and Technology, Coimbatore – 641032, Tamil Nadu, India
 

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

Abstract Views: 201

PDF Views: 0




  • A Novel Approach to Design the Finite Automata to Accept the Palindrome with the Three Input Characters

Abstract Views: 201  |  PDF Views: 0

Authors

P. Ezhilarasu
Department of Computer Science and Engineering, Hindusthan College of Engineering and Technology, Coimbatore - 641032, Tamil Nadu, India
J. Prakash
Department of Computer Science and Engineering, Hindusthan College of Engineering and Technology, Coimbatore - 641032, Tamil Nadu, India
N. Krishnaraj
Department of Information Technology, Valliammai Engineering College, Kattankulathur, Chennai - 603203, Tamil Nadu, India
D. Satheesh Kumar
Department of Computer Science and Engineering, Hindusthan College of Engineering and Technology, Coimbatore - 641032, Tamil Nadu, India
K. Suresh Babu
Department of Electronics and Communication Engineering, Hindusthan Institute of Technology, Coimbatore - 641032, Tamil Nadu, India
C. Parthasarathy
Department of Mechatronics Engineering, Hindusthan College of Engineering and Technology, Coimbatore – 641032, Tamil Nadu, India

Abstract


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.



DOI: https://doi.org/10.17485/ijst%2F2015%2Fv8i28%2F121406