On modal mu-calculus and Büchi tree automata

DOI10.1016/0020-0190(94)00227-PzbMath1004.68530OpenAlexW2065408915MaRDI QIDQ1349728

Roope Kaivola

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00227-p

zbMATH Keywords

formal languagesBüchi-automataalternationmodal mu-calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ Unnamed Item ⋮ The modal mu-calculus alternation hierarchy is strict

Cites Work

• Results on the propositional \(\mu\)-calculus
• SnS can be modally characterized
• The greatest fixed-points and rational omega-tree languages
• Logical definability of fixed points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On modal mu-calculus and Büchi tree automata