Theory of Computation - Old Questions
3. Define a Turing machine. Construct a TM that accept L = {wcwR | w∈(0, 1) and c is ε or 0 or 1. Show that string 0110 is accepted by this TM with sequence of Instantaneous Description (ID). (2+6+2)
10 marks
|
Asked in 2076 (new)