3 problems

0 votes0 replies0 views
The finite complete rewriting system conjecture for one-relation monoids
A one-relation monoid is a monoid given by a finite presentation with one defining relation. A finite complete rewriting system is a finite rewriting system that is both terminatin…
Conjectureopenone-relation-monoids rewriting-systemsarXiv posted 2 days ago
0 votes0 replies0 views
Adian's conjecture on algorithm $\mathfrak{B}$ and the word problem for one-relation monoids
Let $\mathfrak{A}$ be Adian's procedure, whose indefinite looping is the unresolved case in deciding left divisibility by a letter. An algorithm $\mathfrak{B}$ is the algorithm Adi…
Conjectureopendecision-problems one-relation-monoids word-problemarXiv posted 2 days ago
0 votes0 replies0 views
Adian's conjecture on extending procedure $\mathfrak{A}$ to an algorithm
The procedure $\mathfrak{A}$ is Adian's procedure for addressing left divisibility in one-relation monoids; an algorithm is a procedure that always terminates after finitely many s…
Conjectureopenone-relation-monoids word-problemarXiv posted 2 days ago

The finite complete rewriting system conjecture for one-relation monoids