Theory of Computation - Old Questions
10. For the following regular expression draw an ε- NFA recognizing the corresponding languages.
i. (00 +1)*(10)*
ii. 001*0*11
8 marks
|
Asked in 2070