The greatest fixed-points and rational omega-tree languages
From MaRDI portal
Publication:1082091
DOI10.1016/0304-3975(86)90123-4zbMath0602.68071OpenAlexW2067751623MaRDI QIDQ1082091
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90123-4
Related Items (5)
On modal mu-calculus and Büchi tree automata ⋮ Logical definability of fixed points ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Automata on infinite objects and their applications to logic and programming
Cites Work
- A note on \(\omega\)-regular languages
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- A lattice-theoretical fixpoint theorem and its applications
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The greatest fixed-points and rational omega-tree languages
