The greatest fixed-points and rational omega-tree languages
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 44, 259-274
- https://doi.org/10.1016/0304-3975(86)90123-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- A note on ω-regular languagesTheoretical Computer Science, 1983
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955