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

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

Published:1997 Issue: Volume: Page:225-266
ISSN:
Container-title:Advances in Algorithms, Languages, and Complexity
language:
Short-container-title:

Author:

Otto F.,Kobayashi Y.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4613-3394-4_12.pdf

Reference59 articles.

1. S.I. Adjan. The Burnside Problem and Identities in Groups. Springer- Verlag, Berlin, 1979.

2. D.J. Anick. On the homology of associative algebras. Transactions American Mathematical Society, 296: 641 - 659, 1986.

3. J. Avenhaus and K. Madlener. Subrekursive Komplexitat bei Gruppen: I. Gruppen mit vorgeschriebener Komplexitat. Acta Informatica, 9: 87 – 104, 1977.

4. J. Avenhaus and K. Madlener. Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. Acta Informatica, 9: 183 – 193, 1978.

5. J. Berstel. Congruences plus que parfaites et langages algébriques. In Seminaire d’Informatique Théorique, pages 123–147. Institute de Programmation, 1976–77.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Lyndon’s identity theorem for one-relator monoids;Selecta Mathematica;2022-04-27

2. Free inverse monoids are not FP 2;Comptes Rendus. Mathématique;2021-10-08

3. Groupoids and the algebra of rewriting in group presentations;Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry;2020-09-15

4. The monoids of the patience sorting algorithm;International Journal of Algebra and Computation;2019-02

5. PRESENTATIONS OF INVERSE SEMIGROUPS, THEIR KERNELS AND EXTENSIONS;Journal of the Australian Mathematical Society;2011-06