Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids

Journal of Symbolic Computation

Volumn 26, Issue 5, 1998, Pages 621-648

  Otto, Friedrich ^a   Katsura, Masashi ^b   Kobayashi, Yuji ^c  

^a UNIVERSITY OF KASSEL   (Germany)

^b KYOTO SANGYO UNIVERSITY   (Japan)

^c TOHO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (25)

1. Adian, A.I. (1979). The Burnside Problem and Identities in Groups. Berlin, Springer-Verlag.
2. Avenhaus, J. (1986). On the descriptive power of term rewriting systems. J. Symb. Comput., 2, 109-122.
3. Avenhaus, J., Madlener, K. (1990). Term rewriting and equational reasoning. In R.B. Banerji, ed., Formal Techniques in Artificial Intelligence - A Sourcebook, pp. 1-43. Amsterdam, North-Holland.
4. Bauer, G., Otto, F. (1984). Finite complete rewriting systems and the complexity of the word problem. Acta Informatica, 21, 521-540.
5. Benninghofen, B., Kemmerich, S., Richter, M.M. (1987). Systems of Reductions, LNCS 277. Berlin, Springer-Verlag.
6. Berstel, J. (1979). Transductions and Context-free Languages. Teubner Studienbücher. Stuttgart, Teubner-Verlag.
7. Book, R.V., Otto, F. (1993). String-Rewriting Systems. New York, Springer-Verlag.
8. Borho, W., Kraft, H. (1976). On the Gelfond-Kirillov-dimension. Math. Annalen, 220, 1-24.
9. Buntrock, G. (1996). Wachsende kontext-sensitive Sprachen. Habilitationsschrift, Fakultät für Mathematik und Informatik, Universität Würzburg.
10. Buntrock, G., Otto, F. (1998). Growing context-sensitive languages and Church-Rosser languages. Inf. Comput., 141, 1-36.
11. Dershowitz, N., Jouannaud, J.P. (1990). Rewrite systems. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B.: Formal Models and Semantics, pp. 243-320. Amsterdam, Elsevier.
12. Gilman, R.H. (1987). Groups with a rational cross-section. In S.M. Gersten and J.R. Stallings, eds, Computational Group Theory and Topology, pp. 175-183. Princeton, Princeton University Press.
13. Grzegorczyk, A. (1953). Some classes of recursive functions. Rozprawy Matematycne, 4, 1-45.
14. Jantzen, M. (1988). Confluent String Rewriting. Berlin, Springer-Verlag.
15. Kobayashi, Y. (1995). A finitely presented monoid which has solvable word problem but has no regular complete presentation. Theoret. Comput. Sci., 146, 321-329.
16. Madlener, K., Otto, F. (1988). Pseudo-natural algorithms for finitely generated presentations of monoids and groups. J. Symb. Comput., 5, 339-358.
17. McNaughton, R., Narendran, P., Otto, F. (1988). Church-Rosser Thue systems and formal languages. J. Assoc. Computing Machinery, 35, 324-344.
18. Niemann, G., Otto, F. (1998). The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In M. Nivat, ed., Foundations of Software Science and Computation Structures, Proceedings FoSSaCS'98, LNCS 1378, pp. 243-257. Berlin, Springer-Verlag.
19. Ó'Dúnlaing, C. (1983). Infinite regular Thue systems. Theoret. Comput. Sci., 25, 171-192.
20. Sattler-Klein, A. (1991). Divergence phenomena during completion. In R.V. Book, ed., Rewriting Techniques and Applications, LNCS 488, pp. 374-385. Berlin, Springer-Verlag.
21. Sattler-Klein, A. (1996). A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems, Doctoral Dissertation, Fachbereich Informatik, Universität Kaiserslautern.
22. Squier, C.C. (1987). Word problems and a homological finiteness condition for monoids. J. Pure Appl. Algebra, 49, 201-217.
23. Squier, C.C., Otto, F., Kobayashi, Y. (1994). A finiteness condition for rewriting systems. Theoret. Comput. Sci., 131, 271-294.
24. Tourlakis, G.J. (1984). Computability. Reston, Reston Publ. Co..
25. Weihrauch, K. (1974). Teilklassen primitiv-rekursiver Wortfunktionen. Bericht Nr. 91, GMD Bonn.