On Finite Complete Presentations and Exact Decompositions of Semigroups
DOI10.1080/00927872.2010.514314zbMath1242.20063OpenAlexW1987829188MaRDI QIDQ3113838
Publication date: 25 January 2012
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.2/3807
semidirect productstransversalscomplete rewriting systemsfactorizable semigroupscomplete presentationsZappa-Szep productszero exact decompositionszero Rees matrix semigroups
General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Finite complete rewriting systems for regular semigroups.
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- Zappa products
- Conjugacy in monoids with a special Church-Rosser presentation is decidable
- Finite derivation type for semi-direct products of monoids
- A finiteness condition for rewriting systems
- Finite derivation type for Rees matrix semigroups
- Finite derivation type for large ideals.
- Semigroups under a sandwich operation
- Low dimensional homotopy for monoids II: groups
- Soluble groups with a finite rewriting system
- Generators and relations of Rees matrix semigroups
- Subgroups of finite index in groups with finite complete rewriting systems
- FINITE PRESENTABILITY OF SEMIGROUP CONSTRUCTIONS
- PRESENTATIONS FOR SEMIGROUPS AND SEMIGROUPOIDS
- Factorizable semigroups
This page was built for publication: On Finite Complete Presentations and Exact Decompositions of Semigroups