Reidemeister-Schreier type rewriting for semigroups

DOI10.1007/BF02573619zbMath0833.20069OpenAlexW2002252248MaRDI QIDQ1895805

Nikola Ruškuc, Edmund F. Robertson, Colin M. Campbell, Richard M. Thomas

Publication date: 17 March 1996

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

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

zbMATH Keywords

presentationsgenerating setsindexfinitely presented semigroupsSchützenberger groupsReidemeister-Schreier rewriting method0-minimal left idealsrewriting methodstwo sided ideals

Mathematics Subject Classification ID

Ideal theory for semigroups (20M12) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

Related Items (19)

FINITE PRESENTABILITY OF SEMIGROUP CONSTRUCTIONS ⋮ PRESENTATIONS OF INVERSE SEMIGROUPS, THEIR KERNELS AND EXTENSIONS ⋮ On Finite Presentability of Bruck–Reilly Extensions of a Monoid with Respect to an Endomorphism and Its Powers ⋮ Finite derivation type for large ideals. ⋮ Presentations for subsemigroups -- applications to ideals of semigroups ⋮ CANCELLATIVE AND MALCEV PRESENTATIONS FOR FINITE REES INDEX SUBSEMIGROUPS AND EXTENSIONS ⋮ Generators and relations for subsemigroups via boundaries in Cayley graphs. ⋮ Automatic presentations and semigroup constructions ⋮ An introduction to presentations of monoid acts: quotients and subacts ⋮ An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings ⋮ PRESENTATIONS FOR SEMIGROUPS AND SEMIGROUPOIDS ⋮ Presentations for subgroups of monoids ⋮ Syntactic and Rees indices of subsemigroups ⋮ Finite complete rewriting systems and finite derivation type for small extensions of monoids ⋮ Automaton semigroups ⋮ Generators and relations of direct products of semigroups ⋮ A note on maximal group homomorphic images of completely simple semigroups ⋮ Generators and relations of Rees matrix semigroups ⋮ Automatic semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• Coset Enumeration in a Finitely Presented Semigroup
• DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP
• On semigroup presentations
• REWRITING A SEMIGROUP PRESENTATION
• Some Remarks on Semigroup Presentations
• A practical method for enumerating cosets of a finite abstract group

This page was built for publication: Reidemeister-Schreier type rewriting for semigroups