Theory of Computation - Old Questions
4. Define Turing Machines. Draw NFA - ε corresponding to following regular expression over ∑ = {0,1}
010* + 0(01+10)* 11
4 marks
|
Asked in 2070