On semigroup presentations

DOI10.1017/S0013091500005897zbMath0796.20046OpenAlexW2018973097MaRDI QIDQ4289431

Yusuf Ünlü, Edmund F. Robertson

Publication date: 26 September 1994

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0013091500005897

zbMATH Keywords

relationsgeneratorsimplementationfinitely presented semigroupssemigroup presentationsgroup presentationTodd-Coxeter coset enumerationsemigroup enumeration algorithm

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (15)

MORE ON THE NON-COMMUTATIVE EPIGROUPS WHICH ARE NOT QUASI-COMMUTATIVE ⋮ Fibonacci semigroups ⋮ Word problems of groups: formal languages, characterizations and decidability ⋮ Reidemeister-Schreier type rewriting for semigroups ⋮ Matrix semigroups -- generators and relations ⋮ On the identification of finite non-group semigroups of a given order ⋮ Semigroups related to certain group presentations. ⋮ Certain one-relator products of semigroups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two classes of finite semigroups and monoids involving Lucas numbers. ⋮ Syntactic and Rees indices of subsemigroups ⋮ Generators and relations of direct products of semigroups ⋮ Classes of non-commutative semigroups with finite Fibonacci invariants

Cites Work

• On \((2,n)\)-groups related to Fibonacci groups
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Coset Enumeration in a Finitely Presented Semigroup
• Some Remarks on Semigroup Presentations

This page was built for publication: On semigroup presentations