Regular languages of nested words: fixed points, automata, and synchronization
From MaRDI portal
Publication:649107
DOI10.1007/S00224-010-9292-5zbMath1236.68160OpenAlexW2035927058MaRDI QIDQ649107
Marcelo Arenas, Pablo Barceló, Leonid O. Libkin
Publication date: 30 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/127551
\(\mu\)-calculusautomatamonadic second-order logicquery languagesautomatic structuresnested wordspush-down machines
Related Items (2)
Synchronizing deterministic push-down automata can be really hard ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic uses of the Feferman-Vaught theorem
- Synchronized rational relations of finite and infinite words
- Elements of finite model theory.
- Complete problems for deterministic polynomial time
- Logic and \(p\)-recognizable sets of integers
- Query automata over finite trees
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Query Automata for Nested Words
- Definable relations and first-order query languages over strings
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Visibly pushdown languages
- Adding Nesting Structure to Words
- Synchronization of Pushdown Automata
- First-Order and Temporal Logics for Nested Words
- Logical definability and query languages over ranked and unranked trees
- Tools and Algorithms for the Construction and Analysis of Systems
- A fixpoint calculus for local and global program flows
- Regularity Problems for Visibly Pushdown Languages
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Monadic datalog and the expressive power of languages for Web information extraction
- On Relations Defined by Generalized Finite Automata
- Languages of Nested Trees
- Rudiments of \(\mu\)-calculus
This page was built for publication: Regular languages of nested words: fixed points, automata, and synchronization
