(Solved) : 1 20pt Construct Deterministic Turing Machine M Decides Language L B W Ab Substring Ends B Q33388620 . . .
1. (20pt) Construct a deterministic Turing machine M that decides the language L wE a, b)* w has ab as a substring and ends with ba). M starts with the initial configuration (s, Dw) and halts with the configuration (g, Dw), for the appropriate q E y,n. Describe M in detail using a directed graph whose edges are labelled by transitions (such as the one in Example 17.2, p. 368 of textbook) Show transcribed image text
Expert Answer
Answer to 1 20pt Construct Deterministic Turing Machine M Decides Language L B W Ab Substring Ends B Q33388620 . . .
OR