Visualizing the minimization of a deterministic finite state automaton
The minimization of deterministic finite state automata is one of the challenging concepts that students of an introductory theory of computation course must master. The minimization algorithm identifies redundant states that may occur in any deterministic finite state automaton and combines them in...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2007
|
| Online Access: | http://etd.lib.montana.edu/etd/2007/kshatriyajagannath/KshatriyaJagannathR1207.pdf |