Top

NondeterministicFiniteAutomaton

A Nondeterministic Finite Automaton, or NFA, is a construct that can deal with a certain class of computer science problems.

For many CS Majors?, we can close our eyes and see Professor Prasad Jayanti? in a computer science 49? class, lecturing on NFAs. Definately one of my favorite lectures at Dartmouth.

RobinsonTryon - 10 Mar 2003