Lecture 7 (Computation Theory) Regular Expressions and the Pumping Lemma

A generalized NFA (GNFA) differs from an ordinary NFA in that:

1. A.Its edges are labeled with arbitrary regular expressions rather than single symbols or ε
2. B.It is permitted to have infinitely many states between the start and accept
3. C.Its transition function returns a probability distribution over next states
4. D.It reads its input from right to left rather than left to right