Scribd Logo
Upload

Welcome to Scribd!

  • Turing Machine For Even Length Palindrome

    Uploaded by

    Gurjot Singh Mahi
    81 views3 pages
    This document describes a Turing machine that checks if a string over the binary alphabet {0,1} is a palindrome. It has states q[0] through q[*] that read the input tape from left to right, and possibly move left or right while writing symbols. If the string is a palindrome, it will enter the accept state, otherwise it will enter the reject state.

    Original Description:

    machine code for even length palindrome

    Original Title

    Turing Machine for Even Length Palindrome

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes a Turing machine that checks if a string over the binary alphabet {0,1} is a palindrome. It has states q[0] through q[*] that read the input tape from left to right, and possibly move left or right while writing symbols. If the string is a palindrome, it will enter the accept state, otherwise it will enter the reject state.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    81 views3 pages

    Turing Machine For Even Length Palindrome

    Uploaded by

    Gurjot Singh Mahi
    This document describes a Turing machine that checks if a string over the binary alphabet {0,1} is a palindrome. It has states q[0] through q[*] that read the input tape from left to right, and possibly move left or right while writing symbols. If the string is a palindrome, it will enter the accept state, otherwise it will enter the reject state.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    Turing machine For Even palindrome over {0,1}

    state = q[0]
    while(TRUE)
    do
    switch(state)
    do
    case q[0]:
    switch(current read symbol)
    do
    case 0:
    write (b);
    state = q[];
    mo!ement (ri"ht);
    brea#;
    case :
    write (b);
    state = q[$];
    mo!ement (ri"ht);
    brea#;
    case b:
    write (b);
    state = q(acce%t);
    mo!ement (ri"ht);
    brea#;
    end;
    brea#;
    case q[]:
    switch(current read symbol)
    do
    case 0:
    write (0);
    state = q[];
    mo!ement (ri"ht);
    brea#;
    case :
    write ();
    state = q[];
    mo!ement (ri"ht);
    brea#;
    case b:
    write (b);
    state = q[&];
    mo!ement (le't);
    brea#;
    end;
    brea#;
    case q[&]:
    switch(current read symbol)
    do
    case 0:
    write (b);
    state = q[(];
    mo!ement (le't);
    brea#;
    case :
    write (0);
    state = q(re)ect);
    mo!ement (ri"ht);
    brea#;
    case b:
    write (0);
    state = q(re)ect);
    mo!ement (ri"ht);
    brea#;
    end;
    brea#;
    case q[(]:
    switch(current read symbol)
    do
    case 0:
    write (0);
    state = q[(];
    mo!ement (le't);
    brea#;
    case :
    write ();
    state = q[(];
    mo!ement (le't);
    brea#;
    case b:
    write (b);
    state = q[0];
    mo!ement (ri"ht);
    brea#;
    end;
    brea#;
    case q[$]:
    switch(current read symbol)
    do
    case 0:
    write (0);
    state = q[$];
    mo!ement (ri"ht);
    brea#;
    case :
    write ();
    state = q[$];
    mo!ement (ri"ht);
    brea#;
    case b:
    write (b);
    state = q[*];
    mo!ement (le't);
    brea#;
    end;
    brea#;
    case q[*]:
    switch(current read symbol)
    do
    case 0:
    write (0);
    state = q(re)ect);
    mo!ement (ri"ht);
    brea#;
    case :
    write (b);
    state = q[(];
    mo!ement (le't);
    brea#;
    case b:
    write (0);
    state = q(re)ect);
    mo!ement (ri"ht);
    brea#;
    end;
    brea#;
    case q(acce%t):
    acce%t();
    case q(re)ect):
    re)ect();
    end
    end

    You might also like