P. Ezhilarasu ¹, J. Prakash ¹, N. Krishnaraj ², D. Satheesh Kumar ¹, K. Suresh Babu ³, C. Parthasarathy ⁴

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

Abstract

Background/Objectives: In this paper we discuss that, how Finite Automata can accept the palindrome statically. Methods/Statistical Analysis: The formula 3⁰+3¹+3²+…+3ⁿ 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¹+2*3²+1*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.

Keywords

Finite Automata, Input Characters, Palindrome, String Length, Turing Machine.

Full Text