Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey

F. Otto () and Y. Kobayashi ()
Additional contact information
F. Otto: Universität — Gh Kassel, Fachbereich Mathematik/Informatik
Y. Kobayashi: Toho University, Department of Information Science, Faculty of Science

A chapter in Advances in Algorithms, Languages, and Complexity, 1997, pp 225-266 from Springer

Abstract: Abstract In recent years a number of conditions have been established that a monoid must necessarily satisfy if it is to have a presentation through some finite convergent string-rewriting system. Here we give a survey on this development, explaining these necessary conditions in detail and describing the relationships between them.

Keywords: Word Problem; Regular Language; Critical Pair; Congruence Class; Combinatorial Group Theory (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-3394-4_12

Ordering information: This item can be ordered from
http://www.springer.com/9781461333944

DOI: 10.1007/978-1-4613-3394-4_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().