Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
Comprehension Passage
The figure displayed below represents a finite state automaton.
Which one of the not correct output string in given automaton?
1
bba
2
baba
3
bbbb
4
abbba