Pushdown automata with counters
From MaRDI portal
Publication:2554231
DOI10.1016/S0022-0000(72)80019-9zbMath0242.68022MaRDI QIDQ2554231
Publication date: 1972
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Alternating multihead finite automata, Unnamed Item, Relationships between pushdown automata with counters and complexity classes
Cites Work
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- On the computational power of pushdown automata
- Turing machines with restricted memory access
- Recognition and parsing of context-free languages in time n3
- Two-way pushdown automata
- Counter machines and counter languages
- Multi-tape and multi-head pushdown automata
- Note on tape reversal complexity of languages
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Time and tape complexity of pushdown automaton languages