论文信息 - On monoids presented by a single relation

On monoids presented by a single relation

Abstract A monoid presented by a single relation has elements ≠ 1 of finite order if and only if the presentation is 〈 X ; p m p ′ = p n p ′〉, 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.

Gerard Lallement | G. Lallement

[1] M. Schützenberger,et al. The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[2] Pierre Cartier,et al. Problemes combinatoires de commutation et rearrangements , 1969 .

[3] Ann Yasuhara. The solvability of the word problem for certain semigroups , 1970 .

[4] Gilbert Baumslag,et al. Some two-generator one-relator non-Hopfian groups , 1962 .

[5] W. Magnus,et al. Elements of finite order in groups with a single defining relation , 1960 .

[6] S. Adjan,et al. Defining Relations and Algorithmic Problems for Groups and Semigroups , 1967 .

[7] R. J. Koch,et al. Some results on stability in semigroups , 1965 .

[8] Residually finite one-relator groups , 1967 .