Converting two-way nondeterministic unary automata into simpler automata.
Viliam GeffertCarlo MereghettiGiovanni PighizziniPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- finite automata
- finite state
- finite automaton
- probabilistic automata
- cellular automata
- regular expressions
- markov chain
- tree automata
- pairwise
- finite state machines
- deterministic automata
- image processing
- neural network
- database
- relational databases
- finite state automata
- search engine
- lattice gas
- formal language theory
- real time
- grammatical inference
- database systems