Question

The diagram given below refers to a non-deterministic finite state automaton that accepts the language having

• A. All words that contain the repetition of \(ab\) and end with \(a\)
• B. All words that contain the substring \(ba\) and end with \(a\)
• C. All words that end with \(a\)
• D. All words that end with \(b\)

Hint:

If an NFA/DFA reaches a final state only through a transition labeled \(a\), and that final state has no outgoing transitions, then accepted strings typically end with \(a\). Always inspect the final transition leading to the accepting state.

Answer 1

The Correct Option is C