AbstractThe monoid J presented by the Thue system with the single rewriting rule (abbaab, 1) is studied. It is shown that there is an equivalent Thue system that presents this monoid and has the property that every word has a unique normal form
AbstractWe take the set S of the seven fundamental deterministic root-to-frontier tree transformatio...
AbstractIt is shown that it is decidable whether an equation over a free partially commutative monoi...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
AbstractWe present a single-axiom. Thue system with a decidable word problem for which there does no...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractA finitely presented monoid has a decidable word problem if and only if it can be presented ...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
AbstractWe study inverse monoids presented by a finite set of generators and one relation e = 1, whe...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
AbstractWe take the set S of the seven fundamental deterministic root-to-frontier tree transformatio...
AbstractA linear-time algorithm is given for the word problem for free partially commutative groups....
AbstractWe give an O(|A|2×|T|) algorithm that on the input of a regular Church-Rosser Thue system T ...
AbstractWe take the set S of the seven fundamental deterministic root-to-frontier tree transformatio...
AbstractIt is shown that it is decidable whether an equation over a free partially commutative monoi...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
AbstractWe present a single-axiom. Thue system with a decidable word problem for which there does no...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractA finitely presented monoid has a decidable word problem if and only if it can be presented ...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
AbstractWe study inverse monoids presented by a finite set of generators and one relation e = 1, whe...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
AbstractWe take the set S of the seven fundamental deterministic root-to-frontier tree transformatio...
AbstractA linear-time algorithm is given for the word problem for free partially commutative groups....
AbstractWe give an O(|A|2×|T|) algorithm that on the input of a regular Church-Rosser Thue system T ...
AbstractWe take the set S of the seven fundamental deterministic root-to-frontier tree transformatio...
AbstractIt is shown that it is decidable whether an equation over a free partially commutative monoi...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
DOI
Add to ORKG