This article is cited in 6 scientific papers (total in 6 papers)
On semigroups with one relation and semigroups without cycles
G. U. Oganesyan
The left divisibility problem for semigroups without left cycles is reduced to the same problem for semigroups which describe certain transformations of words in the original semigroup. Using this reduction one can solve positively the word and left divisibility problems for semigroups of the form $\langle a,b; a=bAa\rangle$, where $A$ is an arbitrary word in the alphabet $a,b$.
Bibliography: 5 titles.
PDF file (699 kB)
Mathematics of the USSR-Izvestiya, 1983, 20:1, 89–95
MSC: Primary 20M05; Secondary 03D40
G. U. Oganesyan, “On semigroups with one relation and semigroups without cycles”, Izv. Akad. Nauk SSSR Ser. Mat., 46:1 (1982), 88–94; Math. USSR-Izv., 20:1 (1983), 89–95
Citation in format AMSBIB
\paper On semigroups with one relation and semigroups without cycles
\jour Izv. Akad. Nauk SSSR Ser. Mat.
\jour Math. USSR-Izv.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
David A. Jackson, “Some one-relator semigroup presentations with solvable word problems”, Math Proc Camb Phil Soc, 99:3 (1986), 433
James Howie, Stephen J. Pride, “The word problem for one-relator semigroups”, Math Proc Camb Phil Soc, 99:1 (1986), 33
S. I. Adian, “On the divisibility problem for one-relator monoids”, Math. Notes, 55:1 (1994), 3–7
V. S. Guba, “On the relationship between the problems of equality and divisibility of words for semigroups with a single defining relation”, Izv. Math., 61:6 (1997), 1137–1169
Yuji Kobayashi, “Homotopy reduction systems for monoid presentations Asphericity and low-dimensional homology”, Journal of Pure and Applied Algebra, 130:2 (1998), 159
S. I. Adian, V. G. Durnev, “Decision problems for groups and semigroups”, Russian Math. Surveys, 55:2 (2000), 207–296
|Number of views:|