Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition
From MaRDI portal
Publication:2842604
DOI10.1016/S1571-0661(05)80365-2zbMath1270.68147MaRDI QIDQ2842604
Publication date: 15 August 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Conjunctive and Boolean grammars: the true general case of the context-free grammars, Three notes on the complexity of model checking fixpoint logic with chop
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- A grammatical characterization of alternating pushdown automata
- A characterization of exponential-time languages by alternating context- free grammars
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- A lattice-theoretical fixpoint theorem and its applications
- Alternation
- On model checking for the \(\mu\)-calculus and its fragments
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic