Theory of Computation - Old Questions
9. Show that for any regular expression, there is a NFA that accepts the same language represented by r. Convert the regular expression (a+b) (aa+ba)* + ab(a+b)* bba into NFA.
8 marks
|
Asked in 2068