Extending finite-memory automata with non-deterministic reassignment (Extended abstract).
Michael KaminskiDaniel ZeitlinPublished in: AFL (2008)
Keyphrases
- extended abstract
- finite automata
- finite state automaton
- turing machine
- probabilistic automata
- memory usage
- regular expressions
- deterministic finite automata
- finite number
- black box
- computing power
- deterministic automata
- neural network
- memory size
- finite state
- associative memory
- memory requirements
- cellular automata
- search algorithm
- limited memory
- random access
- tree automata
- information systems