Tinput-driven pushdown, counter, and stack automata

DOI10.3233/FI-2017-1576MaRDI QIDQ4601148zbMATH OpenFDO

Authors Martin Kutrib, Andreas Malcher, Matthias Wendlandt

Publication date 19 January 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tinput-Driven Pushdown Automata
• Input-Driven Queue Automata with Internal Transductions
• Digging input-driven pushdown automata
• Input-driven stack automata
• Further closure properties of input-driven pushdown automata

Cited in

(14)

• Input-driven multi-counter automata
• Input-driven multi-counter automata
• Input-driven queue automata: finite turns, decidability, and closure properties
• Digging input-driven pushdown automata
• Input-driven double-head pushdown automata
• Edit distance neighbourhoods of input-driven pushdown automata
• On the power of pushing or stationary moves for input-driven pushdown automata
• Input-driven stack automata
• Tree-walking-storage automata
• On the power of pushing or stationary moves for input-driven pushdown automata
• Beyond operator-precedence grammars and languages
• Exact descriptional complexity of determinization of input-driven pushdown automata
• Tinput-Driven Pushdown Automata
• Input-Driven Double-Head Pushdown Automata

This page was built for publication: Tinput-driven pushdown, counter, and stack automata

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