On the word problem for special semigroups
Izvestiya. Mathematics, Tome 13 (1979) no. 3, pp. 663-676
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
An algorithm is constructed which solves the word problem for special semigroups with overlapping of defining words less than $\frac13$. Bibliography: 4 titles.
[1] Adyan S. I., “Opredelyayuschie sootnosheniya i algoritmicheskie problemy dlya grupp i polugrupp”, Tr. Matem. in-ta im. V. A. Steklova AN SSSR, 85, 1966, 3–123
[2] Lyndon R. S., “On Dehn's Algorithm”, Math. Ann., 166 (1966), 208–228 | DOI | MR | Zbl
[3] Kashintsev E. V., “Grafy i problema tozhdestva dlya konechnoopredelennykh polugrupp”, Uch. zap. Tulskogo pedinstituta, 2 (1970), 290–302
[4] Kashintsev E. V., “K probleme tozhdestva dlya spetsialnykh polugrupp”, IV Vsesoyuzn. konferentsiya po matem. logike, 1976, 58