Height-Deterministic Pushdown Automata
From MaRDI portal
Publication:3525562
DOI10.1007/978-3-540-74456-6_13zbMath1147.68562OpenAlexW1804522637MaRDI QIDQ3525562
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_13
Related Items (15)
Descriptional Complexity of Input-Driven Pushdown Automata ⋮ Tree template matching in ranked ordered trees by pushdown automata ⋮ Synchronization of Regular Automata ⋮ Colored nested words ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Unnamed Item ⋮ Precedence Automata and Languages ⋮ Efficient determinization of visibly and height-deterministic pushdown automata ⋮ Operator precedence and the visibly pushdown property ⋮ Tree Template Matching in Ranked Ordered Trees by Pushdown Automata ⋮ Unnamed Item
This page was built for publication: Height-Deterministic Pushdown Automata
