Finite complete rewriting systems for regular semigroups.

DOI10.1016/J.TCS.2010.10.020MaRDI QIDQ627163zbMATH OpenOpenAlexFDO

Authors R. Gray, A. Malheiro

Publication date 21 February 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1005.2972

zbMATH Keywords

maximal subgroupspresentationsregular semigroupscompletely 0-simple semigroupsfinitely presented semigroupsideal extensionsfinite complete rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Free semigroups, generators and relations, word problems (20M05) Regular semigroups (20M17)

Abstract: It is proved that, given a (von Neumann) regular semigroup with finitely many left and right ideals, if every maximal subgroup is presentable by a finite complete rewriting system, then so is the semigroup. To achieve this, the following two results are proved: the property of being defined by a finite complete rewriting system is preserved when taking an ideal extension by a semigroup defined by a finite complete rewriting system; a completely 0-simple semigroup with finitely many left and right ideals admits a presentation by a finite complete rewriting system provided all of its maximal subgroups do.

Recommendations

• scientific article; zbMATH DE number 2074997
• On finite complete rewriting systems and large subsemigroups.
• Finite complete rewriting systems for groups
• Rewrite systems for varieties of semigroups
• Finite complete rewriting systems and finite derivation type for small extensions of monoids
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• scientific article; zbMATH DE number 1419256
• scientific article; zbMATH DE number 1944132
• A finiteness condition for rewriting systems
• Complete rewriting systems and homology of monoid algebras

Cites work

• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• scientific article; zbMATH DE number 1419256 (Why is no real title available?)
• scientific article; zbMATH DE number 3284302 (Why is no real title available?)
• Constructions and presentations for monoids
• Finite complete rewriting systems and finite derivation type for small extensions of monoids
• Finitely approximable regular semigroups
• Homotopy bases and finite derivation type for subgroups of monoids.
• On finite complete rewriting systems and large subsemigroups.
• On finite presentability of monoids and their Schützenberger groups
• On maximal subgroups of free idempotent generated semigroups.
• On properties not inherited by monoids from their Schützenberger groups.
• Presentations for subgroups of monoids
• Structure of regular semigroups. I
• Subgroups of finite index in groups with finite complete rewriting systems
• Subgroups of free idempotent generated semigroups need not be free.

Cited in

(12)

• On subsemigroups of finitely presented semigroups
• A complete rewrite system and normal forms for \((S)_{\text{reg}}\)
• On finite complete rewriting systems and large subsemigroups.
• Right ideal Howson semigroups
• Rewriting system of certain semigroups with three generators
• On properties not inherited by monoids from their Schützenberger groups.
• scientific article; zbMATH DE number 2074997 (Why is no real title available?)
• Rewriting in varieties of idempotent semigroups
• On Finite Complete Presentations and Exact Decompositions of Semigroups
• COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS
• The problems of cyclic equality and conjugacy for finite complete rewriting systems
• Rewrite systems for varieties of semigroups

This page was built for publication: Finite complete rewriting systems for regular semigroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627163)