Finite-Memory Automata with Non-Deterministic Reassignment.
Michael KaminskiDaniel ZeitlinPublished in: Int. J. Found. Comput. Sci. (2010)
Keyphrases
- finite automata
- finite state automaton
- cellular automata
- memory requirements
- turing machine
- memory usage
- probabilistic automata
- memory space
- finite state
- deterministic finite automata
- database
- computational power
- computing power
- random access
- data structure
- databases
- data sets
- finite number
- finite state machines
- associative memory
- case study
- memory size
- search engine
- genetic algorithm