Recommendations
Cited in
(26)- Input-driven pushdown automata on well-nested infinite strings
- Colored nested words
- Multi-matching nested relations
- Nondeterministic state complexity of nested word automata
- Operational state complexity of nested word automata
- The (nested) word problem
- Colored Nested Words
- Hybrid and first-order complete extensions of CaRet
- Query Automata for Nested Words
- Adding nesting structure to 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
- Shuffle Expressions and Words with Nested Data
- An automata-theoretic approach to infinite-state systems
- 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
- First-Order and Temporal Logics for Nested Words
- Counting Multiplicity over Infinite Alphabets
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
- Limitations of lower bound methods for deterministic nested word automata
- Regular languages of nested words: fixed points, automata, and synchronization
- Visibly linear temporal logic
- Visibly pushdown languages in groups
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)
