I'm reading Computer Science: An Interdisciplinary Approach. It mentioned an NFA (nondeterministic finite automaton) with a null transition, as shown above, recognizes all binary strings that do not contain
bba as a substring.
I didn't quite understand why it says so. If the null transition happens before reading the
bba, it stuck at state 2 and will report yes at the end?