Login / Signup
Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks
Vlad Slavici
Daniel Kunkle
Gene Cooperman
Stephen A. Linton
Published in:
CoRR (2011)
Keyphrases
</>
finite state automata
hybrid automata
finite state machines
machine learning
regular expressions
simple examples
lower bound
regular languages
special case
finite automata