Logical definability of fixed points
From MaRDI portal
Publication:1114673
DOI10.1016/0304-3975(88)90129-6zbMath0663.03024OpenAlexW2009275991MaRDI QIDQ1114673
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90129-6
fixed pointstree automatonsystem of equationslabelled tree\(\nu \) \(\mu\)-definabilityBüchi setspecial automaton
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic structures (08A99) Inductive definability (03D70)
Related Items (2)
On modal mu-calculus and Büchi tree automata ⋮ Theμ-calculus alternation-depth hierarchy is strict on binary trees
Cites Work
This page was built for publication: Logical definability of fixed points