COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS
From MaRDI portal
Publication:5461660
DOI10.1142/S0218196705002220zbMath1085.20037MaRDI QIDQ5461660
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
maximal subgroups; groups of units; free monoids; submonoids; complete rewriting systems; special rewriting systems
20M05: Free semigroups, generators and relations, word problems
68Q42: Grammars and rewriting systems
Related Items
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, A Lyndon's identity theorem for one-relator monoids
Cites Work