Tinput-Driven Pushdown Automata

DOI10.1007/978-3-319-23111-2_7zbMath1415.68135OpenAlexW2183831010MaRDI QIDQ2945881

Andreas Malcher, Martin Kutrib, Matthias Wendlandt

Publication date: 15 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-23111-2_7

zbMATH Keywords

closure propertiesinput-driven pushdown automatadecidability questionssequential transducersreal-time deterministic context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

When input-driven pushdown automata meet reversiblity ⋮ Unnamed Item ⋮ Toward a theory of input-driven locally parsable languages ⋮ Edit distance neighbourhoods of input-driven pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive fuzzy formation control for a swarm of nonholonomic differentially driven vehicles. An \(\mathcal H^{\infty}\)-based robus control design
• An adaptive critic neural network for motion control of a wheeled mobile robot
• Operator precedence and the visibly pushdown property
• Input-Driven Stack Automata
• Interaction of "Solitons" in a Collisionless Plasma and the Recurrence of Initial States
• Minimizing Variants of Visibly Pushdown Automata
• The tree width of auxiliary storage