COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS-Reference-Cited by-同舟云学术

COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS

Published:2005-04 Issue:02 Volume:15 Page:207-216
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

MALHEIRO ANTÓNIO¹²

Affiliation:

1. Centro de Álgebra da Universidade de Lisboa, Av. Prof. Gama Pinto, 2, 1649-003 Lisboa, Portugal

2. Departamento de Matemática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Quinta da Torre, 2829-516 Monte de Caparica, Portugal

Abstract

Given a complete rewriting system R on X and a subset X0 of X+ satisfying certain conditions, we present a complete rewriting system for the submonoid of M(X;R) generated by X0. The obtained result will be applied to the group of units of a monoid satisfying H1 = D1. On the other hand we prove that all maximal subgroups of a monoid defined by a special rewriting system are isomorphic.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196705002220

Reference11 articles.

1. String-Rewriting Systems

2. String Rewriting — A Survey for Group Theorists

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

1. Topological finiteness properties of monoids, II: Special monoids, one-relator monoids, amalgamated free products, and HNN extensions;Documenta Mathematica;2024-05-08

2. On the word problem for weakly compressible monoids;Communications in Algebra;2023-06-30

3. Non-finitely generated maximal subgroups of context-free monoids;Journal of Algebra;2023-02

4. Prefix monoids of groups and right units of special inverse monoids;Forum of Mathematics, Sigma;2023

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