On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract).
Natalie SchluterPublished in: Developments in Language Theory (2010)
Keyphrases
- extended abstract
- finite state automaton
- turing machine
- cellular automata
- upper bound
- black box
- lattice gas
- deterministic finite automata
- finite automata
- hierarchical structures
- timed automata
- relaxation algorithm
- deterministic automata
- machine learning
- finite alphabet
- symbol recognition
- hand drawn
- randomized algorithms
- regular expressions
- markov chain
- collaborative filtering
- state space
- data streams
- feature selection