Consider the ﬁNite-State Automaton Given by the Following Transition Diagram$N \left( s _ { 2 } , a \right)$

Question

Examlex · Accepted Answer

The Answer is a.

N \left( s _ { 2 } , a \right) = s _ { 2 }

b.

s _ { 2 }

c. The strings

a b b b a a

and

a

are accepted by the automaton. The strings

a b a b

and

b b a b

are not accepted by the automaton.
d. The language accepted by the automaton is the set of all strings of

a

's and

b

's that end in an

a

.
e.

( a \mid b ) ^ { * } a

Consider the ﬁNite-State Automaton Given by the Following Transition Diagram $N \left( s _ { 2 } , a \right)$