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: | Merryman, William Patrick |
---|---|
Language: | en |
Published: |
2007
|
Online Access: | http://etd.lib.montana.edu/etd/2007/merryman/MerrymanW0507.pdf |
Similar Items
-
Random Generation of Nondeterministic Finite-State Tree Automata
by: Thomas Hanneforth, et al.
Published: (2013-11-01) -
Simplifying Nondeterministic Finite Cover Automata
by: Cezar Câmpeanu
Published: (2014-05-01) -
Equivalence of Deterministic and Nondeterministic Epsilon Automata
by: Trybulec Michał
Published: (2009-01-01) -
Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications
by: Cazalis, Daniel S.
Published: (2007) -
Computing the weight of subtasks in state minimization of nondeterministic finite automata by the branch and bound method
by: M.E. Abramyan
Published: (2021-09-01)