Input-driven stack automata

DOI10.1007/978-3-642-33475-7_3MaRDI QIDQ2915157zbMATH OpenOpenAlexFDO

Authors Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher

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

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

Recommendations

• Tinput-driven pushdown, counter, and stack automata
• Input-driven double-head pushdown automata
• Descriptional complexity of input-driven pushdown automata
• Tinput-Driven Pushdown Automata
• Digging input-driven pushdown automata

Cited in

(18)

• Visit-bounded stack automata
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Input-driven languages are linear conjunctive
• Input-Driven Queue Automata with Internal Transductions
• Tinput-Driven Pushdown Automata
• When input-driven pushdown automata meet reversiblity
• scientific article; zbMATH DE number 3885334 (Why is no real title available?)
• scientific article; zbMATH DE number 3876636 (Why is no real title available?)
• Tinput-driven pushdown, counter, and stack automata
• Input-driven double-head pushdown automata
• Digging input-driven pushdown automata
• On dynamics of automata with a stack
• Input-driven multi-counter automata
• Visit-bounded stack automata
• Input-Driven Double-Head Pushdown Automata
• On the power of pushing or stationary moves for input-driven pushdown automata
• Sweeping input-driven pushdown automata
• Sweeping input-driven pushdown automata

This page was built for publication: Input-driven stack automata

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