Theory of Computation - Old Questions
9. Construct a NFA accepting language of {0, 1} with each string ending with 01 and convert it into equivalent DFA. (2+3)
5 marks
|
Asked in 2076 (new)