Input-driven double-head pushdown automata

zbMATH Open1483.68172arXiv1708.06464MaRDI QIDQ5016364FDOQ5016364

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Adding nesting structure to words
• Growing context-sensitive languages and Church-Rosser languages
• Ordered multi-stack visibly pushdown automata
• Title not available (Why is that?)
• Church-Rosser Thue systems and formal languages
• Title not available (Why is that?)
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Multi-tape and multi-head pushdown automata
• A machine realization of the linear context-free languages
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Input-driven stack automata

Cited In (6)

• Title not available (Why is that?)
• 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)