Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications
Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally chal...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
FIU Digital Commons
2007
|
| Subjects: | |
| Online Access: | http://digitalcommons.fiu.edu/etd/8 http://digitalcommons.fiu.edu/cgi/viewcontent.cgi?article=1080&context=etd |