Ambiguous classes in \(\mu\)-calculi hierarchies

DOI10.1016/j.tcs.2004.10.024zbMath1070.68077OpenAlexW2074210660MaRDI QIDQ1770419

André Arnold, Luigi Santocanale

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.024

zbMATH Keywords

Rabin states

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Index Problems for Game Automata ⋮ The variable hierarchy for the games \(\mu \)-calculus ⋮ On the separation question for tree languages ⋮ On the Strength of Unambiguous Tree Automata ⋮ $$\mu $$ μ -Levels of Interpolation ⋮ Unambiguous Büchi Is Weak ⋮ Monoidal-closed categories of tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games for the \(\mu\)-calculus
• Results on the propositional \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• A game semantics for linear logic
• The modal mu-calculus alternation hierarchy is strict
• On modal mu-calculus and Büchi tree automata
• Fixed point characterization of infinite behavior of finite-state systems
• Games for synthesis of controllers with partial observation.
• Many-dimensional modal logics: theory and applications
• Automata for the modal μ-calculus and related results
• μ-Bicomplete Categories and Parity Games
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
• FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS
• Proof theory
• Rudiments of \(\mu\)-calculus
• On model checking for the \(\mu\)-calculus and its fragments
• Free \(\mu\)-lattices

This page was built for publication: Ambiguous classes in \(\mu\)-calculi hierarchies