Deciding monadic theories of hyperalgebraic trees

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

Volumn 2044 LNCS, Issue , 2001, Pages 253-267

  Knapik, Teodor ^a   Niwiński, Damian ^b   Urzyczyn, Paweł ^b  

^a UNIVERSITÉ DE LA RÉUNION   (France)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTABILITY AND DECIDABILITY; PATHOLOGY;

FINITE TREES; HIGHER-ORDER; HYPERALGEBRAIC TREE; INFINITE TREES; LAMBDA TERMS; LEVEL 2; LEVEL-1; MONADIC SECOND ORDER THEORY;

FORESTRY;

EID: 84888857398     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_21     Document Type: Conference Paper

References (16)

1. A. Arnold and D. Niwiński. Rudiments of μ-calculus. Elsevier, 2001.
2. A. Asperti, V. Danos, C. Laneve, and L. Regnier. Paths in the lambda-calculus. In Proc. 9th IEEE Symp. on Logic in Comput. Sci., pages 426-436, 1994.
3. A. Asperti and S. Guerrini. The optimal implementation of functional programming languages. In Cambridge Tracts in Theoretical Computer Science, volume 45. Cambridge University Press, 1998.
4. A. Berarducci and M. Dezani-Ciancaglini. Infinite lambda-calculus and types. Theoret. Comput. Sci., 212:29-75, 1999.
5. D. Caucal. On infinite transition graphs having a decidable monadic second- order theory. In F. M. auf der Heide and B. Monien, editors, 23th International Colloquium on Automata Languages and Programming, LNCS 1099, pages 194- 205, 1996. A long version will appear in TCS.
6. B. Courcelle. The monadic second-order theory of graphs IX: Machines and their behaviours. Theoretical Comput. Sci., 151:125-162, 1995.
7. W. Damm. The IOand OI-hierarchies. Theoretical Comput. Sci., 20(2):95-208, 1982.
8. H. Hungar. Model checking and higher-order recursion. In L. P. M. Kuty lowski and T. Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, LNCS 1672, pages 149-159, 1999.
9. J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Inńitary lambda calculus. Theoret. Comput. Sci., 175:93-125, 1997.
10. T. Knapik, D. Niwiński, and P. Urzyczyn. Deciding monadic theories of hyperal- gebraic trees, 2001. http://www.univ-reunion.fr/~knapik/ publications/.
11. O. Kupferman and M. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In Computer Aided Verification, Proc. 12th Int. Conference, Lecture Notes in Computer Science. Springer-Verlag, 2000.
12. D. Niwiński. Fixed points characterization of infinite behaviour of finite state systems. Theoretical Comput. Sci., 189:1-69, 1997.
13. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc, 141:1-35, 1969.
14. Z. Sp lawski and P. Urzyczyn. Type xpoints: iteration vs. recursion. In Proc. 4th ICPF, pages 102-113. ACM, 1999.
15. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 389-455. Springer-Verlag, 1997.
16. I. Walukiewicz. Monadic second-order logic on tree-like structures. In C. Puech and R. Reischuk, editors, Proc. STACS '96, pages 401-414. Lect. Notes Comput. Sci. 1046, 1996.