3 search results - page 1 / 1 » Minimalizations of NFA Using the Universal Automaton |
WIA
2004
Springer
14 years 3 months ago
2004
Springer
ACMSE
2006
ACM
14 years 3 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
FORMATS
2007
Springer
14 years 4 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...