Tinput-Driven Pushdown Automata

DOI10.1007/978-3-319-23111-2_7MaRDI QIDQ2945881zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher, 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 propertiesdecidability questionsinput-driven pushdown automatareal-time deterministic context-free languagessequential transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tinput-driven pushdown, counter, and stack automata
• scientific article; zbMATH DE number 2150277
• Tree pushdown automata
• Input-Driven Double-Head Pushdown Automata
• Input-driven double-head pushdown automata
• Digging input-driven pushdown automata
• Decomposing timed push down automata
• Timed Pushdown Automata Revisited
• Input-driven stack automata
• Dense-timed pushdown automata

Cites work

• 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
• scientific article; zbMATH DE number 3885334 (Why is no real title available?)
• scientific article; zbMATH DE number 3696500 (Why is no real title available?)
• scientific article; zbMATH DE number 3523154 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2201358 (Why is no real title available?)
• scientific article; zbMATH DE number 3302285 (Why is no real title available?)
• Input-driven stack automata
• Interaction of `solitons' in a collisionless plasma and the recurrence of initial states
• Minimizing Variants of Visibly Pushdown Automata
• Operator precedence and the visibly pushdown property
• The tree width of auxiliary storage

Cited in

(10)

• Input-driven stack automata
• When input-driven pushdown automata meet reversiblity
• Tinput-driven pushdown, counter, and stack automata
• Higher-order operator precedence languages
• Input-driven double-head pushdown automata
• Digging input-driven pushdown automata
• Edit distance neighbourhoods of input-driven pushdown automata
• On the power of pushing or stationary moves for input-driven pushdown automata
• Toward a theory of input-driven locally parsable languages
• On languages of transduced-input finite automata with translucent letters

This page was built for publication: Tinput-Driven Pushdown Automata

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