On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages.
Oscar H. IbarraTao JiangNicholas Q. TrânHui WangPublished in: Int. J. Found. Comput. Sci. (1993)
Keyphrases
- finite state automata
- expressive power
- language independent
- turing machine
- formal language theory
- regular languages
- cellular automata
- databases
- model checking
- finite automata
- finite state machines
- finite state
- grammatical inference
- language identification
- regular expressions
- tree automata
- query answering
- text summarization
- context free
- reinforcement learning
- database