The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem

DOI10.1007/978-3-540-87531-4_30zbMath1156.68451OpenAlexW1546839366MaRDI QIDQ3540194

Christof Löding, Thomas Colcombet

Publication date: 20 November 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70)

Related Items (4)

Stamina: stabilisation monoids in automata theory ⋮ Weak MSO with the unbounding quantifier ⋮ Unnamed Item ⋮ Automata and rational expressions

Cites Work

• Algorithms for determining relative star height and star height
• Transition graphs and the star-height of regular events
• Tree acceptors and some of their applications
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Distance desert automata and the star height problem
• A Combinatorial Theorem for Trees
• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem