Sequentiality, monadic second-order logic and tree automata

Information and Computation

Volumn 157, Issue 1-2, 2000, Pages 25-51

  Comon, Hubert ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORMAL LOGIC; LINEAR SYSTEMS; TREES (MATHEMATICS);

SECOND-ORDER LOGICS;

COMPUTATIONAL METHODS;

EID: 0034711985     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2838     Document Type: Article

References (24)

1. Antoy, S., and Middeldorp, A. (1994), A sequential reduction strategy, in "4th International conference on Algebraic and Logic Programming, Madrid, Spain, September 1994" (G. Levi and M. Rodríguez-Artalejo, Eds.), Lecture Notes in Computer Science, Vol. 850, pp. 168-185, Springer-Verlag, Berlin.
2. Bogaert, B., and Tison, S. (1992), Equality and disequality constraints on brother terms in tree automata, in "Proc. 9th Symp. on Theoretical Aspects of Computer Science, Paris" (A. Finkel, Ed.), Springer-Verlag, Berlin.
3. Caron, A.-C., Coquidé, J.-L., and Dauchet, M. (1993), Encompassment properties and automata with constraints, in "5th International Conference on Rewriting Techniques and Applications, Montreal, Canada" (C. Kirchner, Ed.), Lecture Notes in Computer Science, Vol. 690, Springer-Verlag, Berlin.
4. Comon, H., and Delor, C. (1994), Equational formulae with membership constraints, Inform. and Comput. 112, 167-216.
5. Dauchet, M., Heuillard, T., Lescanne, P., and Tison, S. (1988), The confluence of ground term rewriting systems is decidable, in "Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, 1988".
6. Dauchet, M., and Tison, S. (1990), The theory of ground rewrite systems is decidable, in "Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia."
7. Dershowitz, N., and Jouannaud, J.-P. (1990), Rewrite systems, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 243-309, North-Holland, Amsterdam.
8. Gécseg, M., and Steinby, M. (1984), "Tree automata," Akademia Kiadó, Budapest.
9. Huet, G., and Lévy, J.-J. (1991), Computations in orthogonal rewriting systems II, in "Computational Logic: Essays in Honor of Alan Robinson" (J.-L. Lassez and G. Plotkin, Eds.), pp. 415-443, MIT Press, Cambridge, MA. Paper was written in 1979.
10. Jouannaud, J.-P., and Sadfi, W. (1994), Strong sequentiality of left-linear overlapping rewrite systems, in "Workshop on Conditional Term Rewriting systems, Jerusalem, July 1994" (N. Dershowitz, Ed.), Lecture Notes in Computer Science, Vol. 968, pp. 235-246, Springer-Verlag, Berlin.
11. Kennaway, J. R. (1989), Sequential evaluation strategies for parallel-or and related reduction systems, Ann. Pure Appl. Logic 43, 31-56.
12. Kennaway, R. (1994), A conflict between call-by-need computation and parallelism, in "Workshop on Conditional Term Rewriting Systems, Jerusalem, July 1994" (N. Dershowitz, Ed.), Lecture Notes Computer Science, Vol. 968, Springer-Verlag, Berlin.
13. Kesner, D. (December 1993), "La définition de fonctions par cas à l'aide de motifs dans des langages applicatifs," Thèse de doctorat, Université Paris-Sud, Orsay, France.
14. Klop, J. W., and Middeldorp, A. (1991), Sequentiality in orthogonal term rewriting systems, J. Symbolic Comput. 12, 161-195.
15. Nagaya, T., Sakai, M., and Toyama, Y. (1995), NVNF-sequentiality of left-linear term rewriting systems, in "Proc. Japanese Workshop on Term Rewriting, Kyoto, July."
16. O'Donnell, M. J. (1977), in "Computing in Systems Described by Equations," Lecture Notes in Computer Science, Vol. 58, Springer-Verlag, Berlin.
17. Oyamaguchi, M. (1993), NV-sequentiality: a decidable condition for call-by-need computations in term rewriting systems, SIAM J. Comput. 22, 114-135.
18. Rabin, M. (1977), Decidable theories, in "Handbook of Mathematical Logic" (J. Barwise, Ed.), pp. 595-629, North-Holland, Amsterdam.
19. Rabin, M. O. (1969), Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, 1-35.
20. Seidl, H. (1990), Deciding equivalence of finite tree automata, SIAM J. Comput. 19, 424-437.
21. Sekar, R. C., and Ramakrishnan, I. V. (1990), Programming in equational logic: beyond strong sequentiality, in "Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia."
22. Thatcher, J. W., and Wright, J. B. (1968), Generalized finite automata with an application to a decision problem of second-order logic, Math. Systems Theory 2, 57-82.
23. Thomas, W. (1990), Automata on infinite objects, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Eds.), pp. 134-191, Elsevier, Amsterdam.
24. Toyama, Y. (1992), Strong sequentiality of left linear overlapping term rewriting systems, in "Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, CA."