Question

The given NFA represents which of the following NFA

(a) (ab U a) *

(b) (a*b* U a*)

(c) (ab U a*)

(d) (ab)* U a*

I got this question in an online interview.

The question is from Building Regular Expressions topic in portion Regular Expressions and Languages of Automata Theory

Answer 1

Correct answer is (a) (ab U a) *

To explain: The Regular expression (ab U a) * is converted to NFA in a sequence of stages as it can be clearly seen in the diagram. This NFA consist of 8 stated while its minimized form only contains 2 states.