Input-driven double-head pushdown automata

MaRDI QIDQ5016364zbMATH OpenFDO

Authors Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt

Publication date 13 December 2021

Full work available at URL https://arxiv.org/abs/1708.06464, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2017.14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Input-driven stack automata
• Digging input-driven pushdown automata
• Tinput-driven pushdown, counter, and stack automata
• Tinput-Driven Pushdown Automata
• When input-driven pushdown automata meet reversiblity

Cites work

• scientific article; zbMATH DE number 3876636 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3696500 (Why is no real title available?)
• A machine realization of the linear context-free languages
• Adding nesting structure to words
• Church-Rosser Thue systems and formal languages
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Growing context-sensitive languages and Church-Rosser languages
• Input-driven stack automata
• Multi-tape and multi-head pushdown automata
• Ordered multi-stack visibly pushdown automata
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Cited in

(6)

• scientific article; zbMATH DE number 3876636 (Why is no real title available?)
• Digging input-driven pushdown automata
• Input-Driven Queue Automata with Internal Transductions
• Input-driven stack automata
• Tinput-Driven Pushdown Automata
• Input-Driven Double-Head Pushdown Automata

This page was built for publication: Input-driven double-head pushdown automata

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