On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store

DOI10.1016/S0019-9958(82)80023-5zbMATH Open0523.68037MaRDI QIDQ3674059FDOQ3674059

Zvi Galil, Pavol Ďuriš

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

hierarchypushdown automatareversal-bounded counter machine languagestwo-way machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• Tradeoffs for language recognition on alternating machines
• Reversal-bounded nondeterministic multicounter machines and complementation
• One-reversal counter machines and multihead automata: revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nondeterministic multicounter machines and complementation
• On reversal bounded alternating Turing machines
• One-Reversal Counter Machines and Multihead Automata: Revisited
• A characterization of reversal-bounded multipushdown machine languages
• New results on the minimum amount of useful space
• Alternation for sublogarithmic space-bounded alternating pushdown automata

This page was built for publication: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674059)