Monoids Mon⟨ a,b:a^αb^βa^γb^δa^εb^φ=b⟩ admit finite complete rewriting systems

2013/02/12 by Alan Cain, Cain, Alan, Victor Maltcev +1
Computer Science · Mathematics · #20M05 #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #Logic, programming, and type systems #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1302.2819

openalex publication_date 2013/02/12 · openalex created_date 2022/09/05 · openalex updated_date 2026/07/28

Abstract

The aim of this note is to prove that monoids Mon⟨ a,b:aUb=b⟩, with aUb of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether the word problem for one-relator monoids is soluble.

Related

• Monoids Mon⟨ a,b:a^αb^βa^γb^δ=b⟩ admit finite complete rewriting systems
• On finite complete rewriting systems, finite derivation type, and\n automaticity for homogeneous monoids
• On equations and first-order theory of one-relator monoids
• Logged Rewriting for Monoids
• Non-finitely related and finitely related monoids