Question

The given NFA corresponds to which of the following Regular expressions?

(a) (0+1) *(00+11) (0+1) *

(b) (0+1) *(00+11) *(0+1) *

(c) (0+1) *(00+11) (0+1)

(d) (0+1) (00+11) (0+1) *

I got this question in exam.

I'd like to ask this question from Regular Expression-Introduction topic in portion Regular Expressions and Languages of Automata Theory

Answer 1

Correct choice is (a) (0+1) *(00+11) (0+1) *

Best explanation: The transition states shown are the result of breaking down the given regular expression in fragments. For dot operation, we change a state, for union (plus) operation, we diverge into two transitions and for Kleene Operation, we apply a loop.