AbstractA monoid presented by a single relation has elements ≠ 1 of finite order if and only if the presentation is 〈X; pmp′ = pnp′〉, where p is a primitive word in the free monoid on X and p′ is a left factor of p. The word problem and the divisibility problems are shown to be solvable. Also necessary and sufficient conditions for residual finiteness are given
the second author was supported by an FCT Investigador advanced fellowship (IF/01622/2013/CP1161/CT0...
AbstractRearrangements of words in a free monoid A∗ are considered and related to some equations in ...
We first show that arithmetic is bi-interpretable (with parameters) with the free monoid and with pa...
AbstractA monoid presented by a single relation has elements ≠ 1 of finite order if and only if the ...
AbstractWe describe an algorithm which partially solves the divisibility problem for monoids with on...
For every one-relator monoid M=⟨A∣u=v⟩ with u,v∈A∗ we construct a contractible M-CW complex and use ...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
This survey is intended to provide an overview of one of the oldest and most celebrated open problem...
AbstractWe give an example of a monoid with finitely many left and right ideals, all of whose Schütz...
AbstractWe show that no finite union of congruence classes [w], w being an arbitrary element of the ...
AbstractA notion of finite derivation type (FDT) introduced by Squier is a finiteness property on ho...
We prove the following results: (1) There is a one-relator inverse monoid Inv⟨A|w=1⟩ with undecidabl...
AbstractRecently, Craig Squier introduced the notion of finite derivation type to show that some fin...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
the second author was supported by an FCT Investigador advanced fellowship (IF/01622/2013/CP1161/CT0...
AbstractRearrangements of words in a free monoid A∗ are considered and related to some equations in ...
We first show that arithmetic is bi-interpretable (with parameters) with the free monoid and with pa...
AbstractA monoid presented by a single relation has elements ≠ 1 of finite order if and only if the ...
AbstractWe describe an algorithm which partially solves the divisibility problem for monoids with on...
For every one-relator monoid M=⟨A∣u=v⟩ with u,v∈A∗ we construct a contractible M-CW complex and use ...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
This survey is intended to provide an overview of one of the oldest and most celebrated open problem...
AbstractWe give an example of a monoid with finitely many left and right ideals, all of whose Schütz...
AbstractWe show that no finite union of congruence classes [w], w being an arbitrary element of the ...
AbstractA notion of finite derivation type (FDT) introduced by Squier is a finiteness property on ho...
We prove the following results: (1) There is a one-relator inverse monoid Inv⟨A|w=1⟩ with undecidabl...
AbstractRecently, Craig Squier introduced the notion of finite derivation type to show that some fin...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
the second author was supported by an FCT Investigador advanced fellowship (IF/01622/2013/CP1161/CT0...
AbstractRearrangements of words in a free monoid A∗ are considered and related to some equations in ...
We first show that arithmetic is bi-interpretable (with parameters) with the free monoid and with pa...
DOI
Add to ORKG