Ask
Login
0
20kviews
Construct Turing machine that accepts the string over E={0,1} and converts every occurrence of 111 to 101.
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 3.5 years ago
theory of computation
ADD COMMENT EDIT
1 Answer
0
732views
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k

  • The turing machine will look for every occurrence of the string 110.

  • State q_2 is for previous two symbols as 11.

  • Next symbol as 0 in $stateq_2$, will initiate the replacement process to replace 110 by 101.

enter image description here

  • The turing machine M is given by:

    $M = (Q, Σ, Ґ, δ,q_0, …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.