Minimal ascending and descending tree automata

SIAM Journal on Computing

Volumn 26, Issue 1, 1997, Pages 39-58

  Nivat, Maurice ^a   Podelski, Andreas ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Minimizatin; Nerode congruence; Tree automata

Indexed keywords

EID: 5544242332     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539789164078     Document Type: Article

References (36)

1. D. BEAUQUIER AND M. NIVAT, About rational subsets of algebras of infinite words, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 194, W. Brauer, ed., Springer-Verlag, Berlin, 1985, pp. 33-42.
2. M. P. COHN, Universal Algebra, Harper and Row, New York, 1965.
3. H. COMON AND C. DELOR, Equational formulae with membership constraints, Rapport de Recherche 649, LRI, Université de Paris Sud, Orsay, France, 1991; Inform. and Comput., 112 (1994), pp. 167-216.
4. S. S. COSMODAKIS, H. GAIFMAN, P. C. KANELLAKIS, AND M. Y. VARDI, Decidable optimization problems for database logic programs, in Proc. 20th Annual ACM Symposium on Theory on Computing, ACM, New York, 1988, pp 477-490.
5. B. COURCELLE, On recognizable sets and tree automata, in Resolution of Equations in Algebraic Structures, Vol. I, H. Aït-Kaci aad M. Nivat, eds., Academic Press, Boston, 1989, pp. 93-125.
6. N. DERSHOWITZ AND J.-P. JOUNNAUD, Rewrite systems, in Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed., North-Holland, Amsterdam, 1990, pp. 243-300.
7. J. DONER, Tree acceptors and some of their applications, J. Comput. System Sci., 4 (1970), pp. 406-451.
8. P. J. DOWNEY, R. SETHI, AND R. E. TARJAN, Variations on the common subexpression problem, J. Assoc. Comput. Mach., 25 (1980), pp. 758-771.
9. S. EILENBERG, Automata, Languages and Machines, Vol. B, Academic Press, New York, 1976.
10. E. A. EMERSON AND C. S. JUTLA, The complexity of tree automata and logics of programs, in Proc. 29th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 328-337.
11. F. GÉCSEG, AND M. STEINBY, Minimal ascending tree automata, Acta Cybernet, 4 (1984), pp. 37-44.
12. F. GÉCSEG AND M. STEINBY, Tree Automata, Akademiai Kiado, Budapest, 1984.
13. R. GIEGERICH AND K. SCHMAL, Code selection techniques: Pattern matching, tree parsing, and inversion of derivors, in Proc. 1988 Europen Symposium on Programming, Lecture Notes in Comput. Sci. 300, Springer-Verlag, Heidelberg, 1988, pp. 245-268.
14. J. HEINZE, Set based program analysis, Ph.D. thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1992.
15. N. HEINTZE AND J. JAFFAR, A finite representation theorem for approximating logic programs, in Proc. 17th ACM Conference on Principles of Programming Languages, ACM, New York, 1990, pp. 197-209.
16. C. HEMERIE AND J. P. KATOEN, Bottom-up tree acceptors, Sci. Comput. Programming, 13 (1990), pp. 51-72.
17. U. HEUTER, First-order properties of finite trees, star-free expressions and aperiodicity, in Proc. 5th Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Comput. Sci. 294, Springer-Verlag, Berlin, New York, Heidelberg, 1988, pp. 136-149.
18. U. HEUTER, Definite tree languages, Bull. European Assoc. Theoret. Comput. Sci., 35 (1988), pp. 137-142.
19. P. MISHRA, Towards a theory of types in prolog, in Proc. 1st IEEE Symposium on Logic Programming, IEEE Computer Society Press, Los Alamitos, CA, 1984, pp. 456-161.
20. D. E. MULLER, Notes on the theory of automata, manuscript, University of Illinois at Urbana-Champaign, Champaign, IL, 1987.
21. D. E. MULLER AND P. E. SCHUPP, Alternating automata on infinite trees, Theoret. Comput. Sci., 54 (1987). pp. 267-276.
22. M. NIVAT, Binary tree codes, in Tree Automata and Languages, M. Nivat and A. Podelski, eds., North-Holland, Amsterdam, 1992, pp. 1-20.
23. M. NIVAT AND A. PODELSKI, Tree monoids and recognizable sets of trees, in Resolution of Equations in Algebraic Structures, Vol. I., H. Aït-Kaci and M. Nivat, eds., Academic Press, Boston, 1989.
24. M. NIVAT AND A. PODELSKI, Another variation on the common subexpression problem, Discrete Math., 114 (1993), pp. 379-401.
25. A. E. PELEGRI-LLOPART, Rewrite systems, pattern matching, and code generation, Ph.D. thesis, Technical Report UCB/CSD 88/423, University of California at Berkeley, Berkeley, CA, 1988.
26. D. PERRIN, Finite automata, in Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed., North-Holland, Amsterdam, 1990, pp. 243-309.
27. P. PÉLADEU, AND A. PODELSKI, On reverse and general definite tree languages, in Proc. International Conference on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 623, W. Kuich, ed., Springer-Verlag, Berlin, New York, Heidelberg, 1992, pp. 150-161.
28. F. PENNIG, Types in Logic Programming, MIT Press, Cambridge, MA, 1992.
29. A. PODELSKI, Monoïdes d'arbres et automates d'arbres, thèse de doctorat, Université de Paris VII, Paris, 1989.
30. J. C. REYNOLDS, Automatic computation of data set definition, Inform. Process., 68 (1969), pp. 456-461.
31. H. SEIDL, Deciding equivalence of finite tree automata, SIAM J. Comput., 19 (1990), pp. 424-437.
32. M. STEINBY, A theory of tree language varieties, in Tree Automata and Languages, M. Nivat and A. Podelski, eds., North-Holland, Amsterdam, 1992, pp. 57-82.
33. J. W. THATCHER AND J. B. WRIGHT, Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory, 2 (1967), pp. 57-81.
34. W. THOMAS, Logical aspects in the study of tree languages, in 9th Colloquium on Trees in Algebra and in Programming, B. Courcelle, ed., Cambridge University Press, Cambridge, UK, 1984, pp. 31-49.
35. J. VIRAGH, Deterministic ascending tree automata I, Acta Cybernet., 5 (1981), pp. 33-42.
36. E. YARDENI AND E. SHAPIRO, A type system for logic programs, in Concurrent Prolog, Vol. 2, E. Shapiro, ed., MIT Press, Cambridge, MA, 1987, pp. 211-244.