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

P  Ezhilarasu; J  Prakash; N  Krishnaraj; D  Satheesh Kumar; K  Suresh Babu  and C  Parthasarathy

doi:10.17485/ijst/2015/v8i28/78189

Article

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

VIEWS 860
PDF 204

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2015/v8i28/78189

Year: 2015, Volume: 8, Issue: 28, Pages: 1-8

Original Article

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

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

¹ Department of Computer Science and Engineering, Hindusthan College of Engineering and Technology, Coimbatore - 641032, Tamil Nadu, India; [email protected], [email protected], [email protected]
² Department of Information Technology, Valliammai Engineering College, Kattankulathur, Chennai - 603203, Tamil Nadu, India; [email protected]
³ Department of Electronics and Communication Engineering, Hindusthan Institute of Technology, Coimbatore - 641032, Tamil Nadu, India; [email protected]
⁴ Department of Mechatronics Engineering, Hindusthan College of Engineering and Technology, Coimbatore – 641032, Tamil Nadu, India; [email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

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