Input-Driven Double-Head Pushdown Automata

DOI10.1142/s0129054122410064OpenAlexW4225996887MaRDI QIDQ6114870

Martin Kutrib, Markus Holzer, Matthias Wendlandt, Andreas Malcher

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054122410064

zbMATH Keywords

closure propertiesinput driven automataaccepting capacitydecidability of formal language problemsdouble-head pushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Ordered multi-stack visibly pushdown automata
• Growing context-sensitive languages and Church-Rosser languages
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Input-Driven Stack Automata
• Adding nesting structure to words
• Church-Rosser Thue systems and formal languages
• Tinput-Driven Pushdown, Counter, and Stack Automata
• A machine realization of the linear context-free languages
• Multi-tape and multi-head pushdown automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Input-Driven Double-Head Pushdown Automata