Infinite string rewrite systems and complexity

Journal of Symbolic Computation

Volumn 25, Issue 6, 1998, Pages 759-793

  Birget, Jean Camille ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032091286     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0198     Document Type: Article

References (38)

1. Bauer, G. (1981). Zur Darstellung von Monoiden durch Regelsysteme, Dissertation, Fachbereich Informatik, Universität Kaiserslautern.
2. Bauer, G. (1985). n-Level rewriting systems. Theoret. Comput. Sci., 40, 85-99.
3. Bauer, G., Otto, F. (1984). 'Finite complete rewriting systems and the complexity of the word problem. Acta Informatica, 21, 521-540.
4. Berstel, J. (1979). Transductions and Context-Free Languages. Teubner, Stuttgart.
5. Boone, W.W., Higman, G. (1974). An algebraic characterization of the solvability of the word problem. J. Austr. Math. Soc., 18, 41-53.
6. Birget, J. C. (1996). Two-way automata and length-preserving homomorphisms. Math. Systems Theory, 29, 191-226.
7. Birget, J. C. (1998) The complexity of the word problem for semigroups and the Higman Embedding Theorem. Int. J. Algebra Comput., to appear.
8. Bergstra, J. E., Tucker, J. V. (1979). A characterization of computable data types by means of finite equational specification methods, Report IW124/79, Matematisch Centruum, Amsterdam.
9. Book, R., Otto, F. (1993). String Rewriting Systems. Springer, Berlin.
10. Cohen, D. E. (1989). Combinatorial Group Theory: A Topological Approach, LMS 14, Cambridge University Press, Cambridge.
11. Craig, W. (1953) On axiomatizability within a system. J. Symbolic Logic, 18, 30-32.
12. Davis, M. (1956). A note on universal Turing machines. In Shannon, C. E., McCarthy, J., eds, Automata Studies, pp. 167-175. Princeton University Press.
13. Deiss, T. (1993). Conditional semi-Thue systems for presenting monoids. In Proc. STACS'92 Finkel, A., Jantzen, M., eds, LNCS 577, pp. 557-565.
14. Eilenberg, S. (1974). Automata, Languages and Machines. Vol. A. Academic Press, New York.
15. Elgot, C. C., Mezei, J. E. (1965). On relations defined by generalized finite automata. IBM J. Res. Dev., 9, 47-68.
16. Epstein, D. B. A., Cannon, J. W., Holt, D. F., Levy, S. V. F., Paterson, M. S., Thurston, W. P. (1992). Word Processing in Groups. Jones and Bartlett, Boston.
17. Evans, T. (1978). An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra. Algebra Universalis, 8, 197-204.
18. 1-norms of finite presentations. In Baumslag, G., Miller, C. F., eds, Algorithms and Classification in Combinatorial Group Theory MSRI Publications, 23, Springer, Berlin.
19. Higgins, P. M. (1992). Techniques of Semigroup Theory. Oxford University Press, Oxford.
20. Higman, G. (1961). Subgroups of finitely presented groups. Proc. of the Roy. Soc. London, Series A, 262, 455-475.
21. Hodges, W. (1993). Model Theory. Cambridge University Press, Cambridge.
22. Hopcroft, J., Ullman, J. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
23. Jantzen, M. (1988). Confluent String Rewriting. Springer, Berlin.
24. Kashintsev, E. V. (1970). Graphs and the word problems for finitely presented semigroups. Uch. Zap. Tul. Fed. Inst. 2, 290-302 (Russian).
25. Kobayashi, Y. (1995). A finitely presented monoid which has solvable word problem but no regular complete presentation. Theoret. Comput. Sci., 146, 321-329.
26. Lyndon, R., Schupp, P. (1977). Combinatorial Group Theory. Springer, Berlin.
27. Madlener, K., Otto, F. (1985). Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. J. Symb. Comput., LNCS 1, 383-418.
28. Madlener, K., Otto, F. (1988). Pseudo-natural algorithms for finitely generated presentations of monoids and groups. J. Symb. Comput., 5, 339-358.
29. Madlener, K., Otto, F. (1989). About the descriptive power of certain classes of finite string-rewriting systems. Theoret. Comput. Sci., 67, 143-172.
30. Meseguer, J., Goguen, J. A. (1985). Initiality, induction, and computability. In Nivat, M., Reynolds, J., eds, Algebraic Methods in Semantics, pp. 459-541. Cambridge University Press, Cambridge.
31. Murski, V. (1967). Isomorphic embeddability of semigroups with countable sets of defining relations in finitely defined semigroups. Matematicheskii Zametki, 1, 217-224 (English translation, pp. 145-149).
32. O'Dúnlaing, C. (1983). Infinite regular Thue systems. Theoret. Comput. Sci., 25, 171-192.
33. Otto, F. (1989). Restrictions of congruences generated by finite canonical string-rewriting systems. In Dershowitz, N., ed., Rewriting Techniques and Applications, 3rd Conf., LNCS 355, pp. 359-370, Springer, Berlin.
34. Remmers, J. H. (1980). On the geometry of semigroup presentations. Advances in Math., 36, 283-296.
35. Sims, C. C. (1994). Computation with Finitely Presented Groups. Cambridge University Press, Cambridge.
36. Squier, C. C. (1987). Word problems and a homological finiteness condition for monoids. J. Pure Appl. Algebra, 49, 201-217.
37. Squier, C. C., Otto, F. (1987). The word problem for finitely presented monoids and finite canonical rewriting systems. In Lescanne, P., ed., Rewriting Techniques and Applications, 2nd Conf. LNCS 256, Berlin, Springer.
38. van Leeuwen, J. (ed.) (1990). Handbook of Theoretical Computer Science. Vols A and B. MIT Press/Elsevier.