On Left-Monotone Deterministic Restarting Automata.
Tomasz JurdzinskiFriedrich OttoFrantisek MrázMartin PlátekPublished in: Developments in Language Theory (2004)
Keyphrases
- finite state automaton
- turing machine
- cellular automata
- upper bound
- finite state machines
- formal language theory
- neural network
- randomized algorithms
- finite state
- regular expressions
- black box
- state space
- finite automata
- artificial neural networks
- lower bound
- stochastic methods
- probabilistic automata
- lattice gas
- artificial intelligence
- real world