Question

Use the construction in Theorem 3.1 to create an nfa that accepts the language L(bb* + aba)

I need explanation as well if possible

Answer 1

Explination:

In the above nfa we have 1 inital state q0

And 2 final states q1 ,q4

q1 is the final state for bb*

q4 is the final state for aba

if the input is b then we do transition form q0 to q1 then for any number of b's we will be in the q1 which is the final state

if the input is a then we do trasition form q0 to q2

then in q2 if b then we do transitio form q2 to q3

then in q3 if  a then we do transition to the final state q4