Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.
Viliam GeffertCarlo MereghettiGiovanni PighizziniPublished in: MFCS (2001)
Keyphrases
- finite automata
- finite state
- finite automaton
- cellular automata
- probabilistic automata
- regular expressions
- pairwise
- markov chain
- tree automata
- formal language theory
- deterministic automata
- lattice gas
- pattern matching
- regular languages
- grammatical inference
- finite state automata
- decision trees
- relational databases
- feature space
- natural language