Cross-sections for finitely presented monoids with decidable word problems

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

Volumn 1232, Issue , 1997, Pages 53-67

  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

ALGEBRA;

CHURCH-ROSSER LANGUAGES; CONTEXT-FREE; MONOIDS; STRING REWRITING; WORD PROBLEM;

COMPUTABILITY AND DECIDABILITY;

EID: 84947744330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62950-5_61     Document Type: Conference Paper

References (11)

1. A.I. Adian. The Burnside Problem and Identities in Groups. Springer-Verlag, Berlin, 1979.
2. J. Avenhaus. On the descriptive power of term rewriting systems. J. Symbolic Computation, 2:109-122, 1986.
3. J. Berstel. Transductions and Context-free Languages. Teubner Studienbücher. Teubner-Verlag, 1979.
4. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.
5. G. Buntrock and F. Otto. Growing context-sensitive languages and Church- Rosser languages. In E.W. Mayr and C. Puech, editors, Proc. of STAGS 95, Lecture Notes in Computer Science 900, pages 313-324. Springer-Verlag, Berlin, 1995.
6. G. Buntrock. Wachsende kontext-sensitive Sprachen. Habilitationsschrift, Fakultät für Mathematik und Informatik, Universität Würzburg, 1996.
7. R.H. Gilman. Groups with a rational cross-section. In S.M. Gersten and J.R. Stallings, editors, Computational Group Theory and Topology, pages 175-183. Princeton, 1987.
8. Y. Kobayashi. A finitely presented monoid which has solvable word problem but has no regular complete presentation. Theoretical Computer Science, 146:321-329, 1995.
9. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal Association Computing Machinery, 35:324-344, 1988.
10. A. Sattler-Klein. Divergence phenomena during completion. In R.V. Book, editor, Rewriting Techniques and Applications, pages 374-385. SpringerVerlag, Berlin, 1991. Lecture Notes in Computer Science 488.
11. C.C. Squier. Word problems and a homological finiteness condition for monoids. J. Pure Applied Algebra, 49:201-217, 1987.