On the asymptotic enumeration of accessible automata.
Elcio LebensztaynPublished in: Discret. Math. Theor. Comput. Sci. (2010)
Keyphrases
- finite automata
- cellular automata
- finite state
- expected values
- search space
- regular expressions
- asymptotically optimal
- large deviations
- laplace transform
- dynamic programming
- upper bound
- finite state machines
- formal language theory
- databases
- lattice gas
- finite state automata
- tree automata
- worst case
- expert systems
- lower bound
- data structure
- machine learning