Adding Nesting Structure to Words
From MaRDI portal
Publication:3617042
DOI10.1007/11779148_1zbMATH Open1227.68045OpenAlexW1492682035MaRDI QIDQ3617042FDOQ3617042
Authors: Parthasarathy Madhusudan, Rajeev Alur 
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
Recommendations
Cited In (25)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- Dependency Tree Automata
- Visibly linear temporal logic
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
- Nondeterministic state complexity of nested word automata
- Colored Nested Words
- First-Order and Temporal Logics for Nested Words
- Realizability of Concurrent Recursive Programs
- Language Strength Reduction
- The (nested) word problem
- Query Automata for Nested Words
- An automata-theoretic approach to infinite-state systems
- Counting Multiplicity over Infinite Alphabets
- Colored nested words
- Hybrid and first-order complete extensions of CaRet
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Operational state complexity of nested word automata
- Regular languages of nested words: fixed points, automata, and synchronization
- Limitations of lower bound methods for deterministic nested word automata
- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
- Shuffle Expressions and Words with Nested Data
- Multi-matching nested relations
- Adding nesting structure to words
- State Complexity of Nested Word Automata
- Input-driven pushdown automata on well-nested infinite strings
This page was built for publication: Adding Nesting Structure to Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617042)
