|
This article is cited in 3 scientific papers (total in 3 papers)
On the word problem for special semigroups
E. V. Kashincev
Abstract:
An algorithm is constructed which solves the word problem for special semigroups with overlapping of defining words less than $\frac13$.
Bibliography: 4 titles.
Received: 06.01.1978
Citation:
E. V. Kashincev, “On the word problem for special semigroups”, Math. USSR-Izv., 13:3 (1979), 663–676
Linking options:
https://www.mathnet.ru/eng/im1976https://doi.org/10.1070/IM1979v013n03ABEH002081 https://www.mathnet.ru/eng/im/v42/i6/p1401
|
Statistics & downloads: |
Abstract page: | 204 | Russian version PDF: | 66 | English version PDF: | 9 | References: | 37 | First page: | 1 |
|