Converting nondeterministic two-way automata into small deterministic linear-time machines.
Bruno GuillonGiovanni PighizziniLuca PrigionieroDaniel PrusaPublished in: Inf. Comput. (2022)
Keyphrases
- turing machine
- finite automata
- finite state
- cellular automata
- deterministic automata
- small number
- worst case
- deterministic finite automata
- regular expressions
- finite state automaton
- finite automaton
- machine intelligence
- black box
- small size
- artificial intelligence
- flowshop
- scheduling problem
- reinforcement learning
- multiscale