Theory of Computation - Old Questions
3. Construct FA recognizing the languages described by following regular expressions.
a) (10*+01*)11*
b) (0+1)*(01+1000)0*
4 marks
|
Asked in 2074