Pushdown automata with counters

DOI10.1016/S0022-0000(72)80019-9zbMath0242.68022MaRDI QIDQ2554231

Yanyan Li

Publication date: 1972

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (3)

Unnamed Item ⋮ Alternating multihead finite automata ⋮ Relationships between pushdown automata with counters and complexity classes

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Pushdown automata with counters