NFAs – non deterministic finite state automata

I am teaching Theoretical Foundations of Computer Science again, and so the exploration and explanation of nod-deterministic finite state automata is on my mind. Here are a few related links nfa lecture with proof that NFA <–> DFA (tags: nfa cpsc326) CMSC 451 Lecture 5, NFA with epsilon moves One of a series of […]

Also tagged