Presentations et presentations simplifiables d'un monoide simplifiable

DOI10.1007/BF02194675zbMath0477.20037OpenAlexW2012139772MaRDI QIDQ1160756

Jean-Claude Spehner

Publication date: 1977

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/186375

zbMATH Keywords

presentationscongruencesfinitely presented semigroupssemigroups embeddable into groups

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05)

Related Items (14)

On the defect theorem and simplifiability ⋮ Every finitely generated submonoid of a free monoid has a finite Malcev's presentation ⋮ Describing semigroups with defining relations of the form \(xy=yz\) and \(yx=zy\) and connections with knot theory ⋮ Green index in semigroups: generators, presentations, and automatic structures. ⋮ CANCELLATIVE AND MALCEV PRESENTATIONS FOR FINITE REES INDEX SUBSEMIGROUPS AND EXTENSIONS ⋮ Compatibility relations on codes and free monoids ⋮ Automatic structures for subsemigroups of Baumslag-Solitar semigroups. ⋮ Relational codes of words ⋮ Gcd-monoids arising from homotopy groupoids ⋮ Defect theorems with compatibility relations. ⋮ Malcev presentations for subsemigroups of direct products of coherent groups. ⋮ Subsemigroups of groups: presentations, Malcev presentations, and automatic structures ⋮ Sur la classification syntaxique ⋮ Some algorithms on the star operation applied to finite languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• On finitely generated subsemigroups of a free semigroup
• On the immersion of an algebraic ring into a field
• On the algorithmic insolvability of the word problem in group theory

This page was built for publication: Presentations et presentations simplifiables d'un monoide simplifiable