Fixed point characterization of infinite behavior of finite-state systems
- 15 December 1997
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 189 (1-2) , 1-69
- https://doi.org/10.1016/s0304-3975(97)00039-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and SafraTheoretical Computer Science, 1995
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- An automata theoretic decision procedure for the propositional mu-calculusInformation and Computation, 1989
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- The greatest fixed-points and rational omega-tree languagesTheoretical Computer Science, 1986
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- Fixed-point characterization of context-free ∞-languagesInformation and Control, 1984
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955