Let M be the Turing Machine diagram as follow: Y/YR a/a R Z/Z R Y/YR a/X...

 

Transcribed Image Text:

Let M be the Turing Machine diagram as follow: Y/YR a/a R Z/Z R Y/YR a/X R B/B R B/BR a a/a R Y/YR b/Y R X/X R b/b R Z/Z R c/Z L a/a L b/bl Y/YL Z/ZL a) Give the transition table of M. b) Trace the computation of M on input strings abc and aabc. c) Give a set-theoretic definition to define the language. Let M be the Turing Machine diagram as follow: Y/YR a/a R Z/Z R Y/YR a/X R B/B R B/BR a a/a R Y/YR b/Y R X/X R b/b R Z/Z R c/Z L a/a L b/bl Y/YL Z/ZL a) Give the transition table of M. b) Trace the computation of M on input strings abc and aabc. c) Give a set-theoretic definition to define the language.