Relationships between pushdown automata with counters and complexity classes
From MaRDI portal
Publication:4118823
DOI10.1007/BF01735143zbMath0348.68032OpenAlexW2006175518MaRDI QIDQ4118823
Publication date: 1975
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01735143
Related Items
Cites Work
- Unnamed Item
- Pushdown automata with counters
- On the Computational Complexity of Algorithms
- Recognition and parsing of context-free languages in time n3
- A note on computing time for recognition of languages generated by linear grammars
- Two-way pushdown automata
- Multi-tape and multi-head pushdown automata
- A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
- An efficient context-free parsing algorithm
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Time and tape complexity of pushdown automaton languages