Animating the conversion of nondeterministic finite state automata to deterministic finite state automata
Many students may find the conversion of non-deterministic finite state automata into deterministic finite state automata to be difficult. Since standard computers are deterministic by nature, it is beneficial to understand how to convert nondeterministic finite state automata into equivalent determ...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2007
|
| Online Access: | http://etd.lib.montana.edu/etd/2007/merryman/MerrymanW0507.pdf |