On fixed-point clones

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 226 LNCS, Issue , 1986, Pages 464-473

  Niwiński, Damian ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORESTRY;

ABSTRACT MODELS; FIXED POINTS; GREATEST FIXED POINTS; INFINITE TREES; POWER SET;

AUTOMATA THEORY;

EID: 85026897255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-16761-7_96     Document Type: Conference Paper

References (17)

1. Arnold, A. & Nivat, M. (1977), Non deterministic recursive programs, in “Fundamentals of Computation Theory”, pp. 12–21, LNCS No. 56, Springer Verlag, Heidelberg.
2. deBakker, J. & deRoever, W. P. (1973), A Calculus for Recursive Program Schemes, First Int. Coll. on Automata, Languages and Programming.
3. Emerson, A. E. & Clarke, E. C. (1980), Characterizing Correctness Properties of Parallel Programs using Fixpoints, Seventh Int. Coll. on Automata, Languages and Programming, 169–181.
4. Engelfriet, J. & Schmidt, E. M. (1978), IO and OI, JCSS 15 (1977), 328–353 and 16 (1978), 67–99.
5. Kozen, D. (1983), Results on the Propositional μ-Calculus, TCS 27, 333–54.
6. Niwiński, D. (1984), Fixed-Point Characterization of Context-Free ∞-Languages, Inform. Contr. 61, 247–276.
7. Niwiński, D. (1985), Equational μ-calculus, in “Computation Theory”, LNCS No. 208, Springer Verlag, Heidelberg.
8. Niwiński, D. (1986), A note on indices of Rabin pair automata, University of Warsaw, manuscript.
9. Park, D. (1980), On the semantics of fair parallelism, in “Abstract Software specifications”, LNCS No. 86, Springer Verlag, Heidelberg.
10. Park, D. (1981), Concurrency and automata on infinite sequences, LNCS No. 104, Springer Verlag, Heidelberg, 167–183.
11. Rabin, M. O. (1969), Decidability os second-order theories and automata on infinite trees, in Trans. Amer. Math. Soc. 141, 1–35.
12. Rabin, M. O. (1970), Weakly definable relations and special automata, in Math. Logic and Found. of Set Theory (Ed. Bar-Hillel), North-Holland.
13. Rabin, M. O. (1972), Automata on Infinite Objects and Church’s Problem, in Proc. Regional AMS Conf. Series in Math. 13, 1–22.
14. Takahashi, M. (1985), The Greatest Fixed-Points and Rational Omega-Tree Languages, Université Paris VII, manuscript.
15. Vardi, M. Y. & Wolper, P. (1984), Automata-theoretic Techniques for Modal Logic of Programs, Report RJ 4450, IBM Research, Yorktown Heights.
16. Wand, M. (1973), First Int. Coll. on Automata, Languages and Programming, 331–344.
17. McNaughton, R. (1966), Testing and generating infinite sequences by a finite automaton, Inform. Contr. 9, 521–530.