COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS

DOI10.1142/S0218196705002220zbMath1085.20037OpenAlexW2042212793MaRDI QIDQ5461660

António Malheiro

Publication date: 26 July 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196705002220

zbMATH Keywords

maximal subgroupsgroups of unitsfree monoidssubmonoidscomplete rewriting systemsspecial rewriting systems

Mathematics Subject Classification ID

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

Related Items (4)

A Lyndon's identity theorem for one-relator monoids ⋮ Prefix monoids of groups and right units of special inverse monoids ⋮ On the word problem for weakly compressible monoids ⋮ Non-finitely generated maximal subgroups of context-free monoids

Cites Work

• Decision problems for finite special string-rewriting systems that are confluent on some congruence class
• Presentations for subgroups of monoids
• Units of special Church-Rosser monoids
• Applying rewriting methods to special monoids

This page was built for publication: COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS