Finite complete rewriting systems for regular semigroups.

DOI10.1016/j.tcs.2010.10.020zbMath1209.20049arXiv1005.2972OpenAlexW1986996290MaRDI QIDQ627163

Robert D. Gray, António 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

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

Related Items (3)

Right ideal Howson semigroups ⋮ On properties not inherited by monoids from their Schützenberger groups. ⋮ On Finite Complete Presentations and Exact Decompositions of Semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homotopy bases and finite derivation type for subgroups of monoids.
• On finite complete rewriting systems and large subsemigroups.
• On properties not inherited by monoids from their Schützenberger groups.
• Finitely approximable regular semigroups
• Finite complete rewriting systems and finite derivation type for small extensions of monoids
• On finite presentability of monoids and their Schützenberger groups
• On maximal subgroups of free idempotent generated semigroups.
• Presentations for subgroups of monoids
• Subgroups of free idempotent generated semigroups need not be free.
• Structure of regular semigroups. I
• Constructions and presentations for monoids
• Subgroups of finite index in groups with finite complete rewriting systems

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