Theory of Automata

Turing Machine for Even Palindromes



A palindrome is sequence of symbols that reads the same backward as forward. For example “aba”.  If the length of palindrome is even then it is also called even palindromes (i.e. abaaba). Let’s see Turing Machine for even palindromes 

Let us construct a Turing machine for even palindromes language (L= abaaba). The Input String will become as under

Turing Machine For Even Palindromes - Input tape

Algorithm for Even Palindromes

  • Step 01: Replace first leftmost symbol  with Blank symbol “$”.
  • Step 02: Replace rightmost symbol  with Blank symbol “$”.
  • Step 03: repeat above both steps (1&2) until all symbols are replaced with “$”

Input Tape For Even Palindromes



Read/Write Head movement on the Input tape is explained under with various steps in diagram

Input tape For Even Palindromes

Turing Machine for Even Palindromes

Turing Machine for Even palindromes is explain under

Turing Machine For Even Palindromes

Help Other’s By Sharing…

Contact Us

Burewala, Vehari, Punjab, Pakistan

cstaleem1@gmail.com

Website: CStaleem.com

Pin It on Pinterest