Header Ads

  • Highlights

    👩🏻‍💻 Hello Readers 🧑🏻‍💻!!! Would you like to Explore more ? Hit on ⓘ(Ads)... ✨🌹

    What is Multiple Turing Machines in TOC ?

    Multiple Turing Machines

    A Turing Machine with a two-way infinite tape is denoted by (Q,Σ, Γ, δ, qacc , q0 , qrej) as in original model.

    Q is a finite and nonempty set of states.

    Σ is an alphabet called the input alphabet, which may not include the blank symbol.

    Γ is an alphabet called the tape alphabet, which must satisfy Σ  { }  Γ.

    δ is a transition function having the form δ : Q\{ qacc , qrej } × Γ → Q × Γ × {←, →}.

    q0  Q is the initial state.

    qacc, qrej  Q are the accept and reject states, which must satisfy qacc  qrej.

    A multiple Turing Machine consists of a finite control with k tape heads and k-tapes, each tape is infinite in both directions, on a single move, depending on the state of the finite control and the symbol scanned by each of tape heads, the machine can be,

    • change state
    • print new symbol on each of the cells scanned by its tape head
    • move each of its tape heads, independently, one cell to the left or right or keep it stationary.
    • Initially, the input appears on the first tape and the other tapes are blank.
           Also, Study about: 

    Also Read, some interview tips

    No comments

    Post Bottom Ad

    Powered by Blogger.