Variations on the technique of Ďuriš and Galil

DOI10.1016/0022-0000(85)90005-4zbMath0576.68061OpenAlexW2000884591MaRDI QIDQ1064791

Marek Chrobak

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90005-4

zbMATH Keywords

non-closure propertiestwo-way counter automata

Mathematics Subject Classification ID

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

Related Items (2)

On the determinacy problem for two-way pushdown automata ⋮ Hierarchies of one-way multihead automata languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fooling a two way automaton or one pushdown store is better than one counter for two way machines
• Transformational methods and their application to complexity problems
• Two-Way Counter Machines and Diophantine Equations
• Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages

This page was built for publication: Variations on the technique of Ďuriš and Galil