The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata.
Yulia DubovMichael KaminskiPublished in: Languages: From Formal to Natural (2009)
Keyphrases
- finite automata
- power consumption
- finite state automaton
- pattern matching
- turing machine
- regular languages
- cellular automata
- probabilistic automata
- regular expressions
- information retrieval
- model checking
- learning algorithm
- black box
- finite state
- randomized algorithms
- finite state machines
- tree automata
- keywords
- decision trees
- deterministic finite automata
- lattice gas
- real world