On finite complete rewriting systems and large subsemigroups.

DOI10.1016/j.jalgebra.2011.08.022zbMath1241.20067arXiv1005.0882OpenAlexW2963297896MaRDI QIDQ408518

P. C. Wong, Kok Bin Wong

Publication date: 10 April 2012

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

rewriting systemsfiniteness conditionspresentations of semigroupslarge subsemigroupssmall extensions

Mathematics Subject Classification ID

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

Related Items

Finite complete rewriting systems for regular semigroups. ⋮ IDEALS AND FINITENESS CONDITIONS FOR SUBSEMIGROUPS ⋮ ON CERTAIN PAIRS OF NON-ENGEL ELEMENTS IN FINITE GROUPS ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids

Cites Work

• Unnamed Item
• Finite complete rewriting systems and finite derivation type for small extensions of monoids
• Artin groups, rewriting systems and three-manifolds
• String rewriting systems and finiteness conditions for monoids
• Structure Results for Transitive, Untwisted, Superlinked Finite Covers

This page was built for publication: On finite complete rewriting systems and large subsemigroups.