Adding Nesting Structure to Words
From MaRDI portal
Publication:3617042
DOI10.1007/11779148_1zbMath1227.68045OpenAlexW1492682035MaRDI QIDQ3617042
Publication date: 26 March 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11779148_1
Related Items (18)
Query Automata for Nested Words ⋮ On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata ⋮ Weighted Logics for Nested Words and Algebraic Formal Power Series ⋮ Language Strength Reduction ⋮ Regular languages of nested words: fixed points, automata, and synchronization ⋮ Hybrid and First-Order Complete Extensions of CaRet ⋮ Visibly linear temporal logic ⋮ Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ Nondeterministic state complexity of nested word automata ⋮ Operational state complexity of nested word automata ⋮ Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression ⋮ Dependency Tree Automata ⋮ Realizability of Concurrent Recursive Programs ⋮ State Complexity of Nested Word Automata ⋮ Counting Multiplicity over Infinite Alphabets ⋮ Input-driven pushdown automata on well-nested infinite strings
This page was built for publication: Adding Nesting Structure to Words
