Consider the language L = {a?"bc" :n € No}over the alphabet {a, b, c}. Match the blue transition labels T1 to T9 in the diagram with the correct symbols so that the depicted diagram becomes a Turing...

correct answer please


Extracted text: Consider the language L = {a?"bc" :n € No}over the alphabet {a, b, c}. Match the blue transition labels T1 to T9 in the diagram with the correct symbols so that the depicted diagram becomes a Turing machine that accepts the language L. You can assume that the input strings on the input tape are surrounded by blanks B, and that the tape head is positioned on the first symbol of the input string. (Hint: Use a strategy where two a's are replaced by blanks on the left side of the input string, and a matching c is replaced by a blank on the right end.) T3 T5 T8 T1 T2 T4 T6 T7 92 93 b/B, R T9 B/B, R T1 | Choose ] T2 | Choose | T3 | Choose ) T4 [ Choose ] T5 | Choose ) T6 | Choose T7 | Choose ] T8 [ Choose | T9 | Choose |


Extracted text: [Choose] [Choose] b/b, R c/c, L a/a, L c/c, R b/b, L c/В, L B/В, L a/a, R a/a, L; b/b, L; c/c, L b/B, L a/В, R В/В. R [Choose ] [Choose ] [Choose]