I am teaching Theoretical Foundations of Computer Science again, and so the exploration and explanation of noddeterministic finite state automata is on my mind. Here are a few related links

nfa lecture with proof that NFA <–> DFA

One of a series of lectures
 Nondeterministic finitestate machine – Wikipedia, the free encyclopedia Wikipedia entry for NFA
(tags: nfa cpsc326)
Post a Comment