Two-way one-counter automata accepting bounded languages.
Holger PetersenPublished in: SIGACT News (1994)
Keyphrases
- finite automata
- regular languages
- cellular automata
- grammatical inference
- formal language theory
- finite state automata
- language independent
- expressive power
- context free
- databases
- formal languages
- probabilistic automata
- language identification
- regular expressions
- finite state
- finite state machines
- pattern languages
- query translation
- turing machine
- information retrieval
- database