Input-Driven Stack Automata

DOI10.1007/978-3-642-33475-7_3zbMath1362.68127OpenAlexW1502281730MaRDI QIDQ2915157

Martin Kutrib, Andreas Malcher, Markus Holzer, Suna Bensch

Publication date: 21 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01556210/file/978-3-642-33475-7_3_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Tinput-Driven Pushdown Automata ⋮ Input-Driven Double-Head Pushdown Automata ⋮ Sweeping input-driven pushdown automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Unnamed Item ⋮ Input-driven multi-counter automata ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties ⋮ Digging input-driven pushdown automata

This page was built for publication: Input-Driven Stack Automata