An algorithm for recognizing the solvability of equations in one unknown over semigroups with overlap of less than $1/3$ in the defining words
Sbornik. Mathematics, Tome 21 (1973) no. 1, pp. 1-32
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
An algorithm is constructed for recognizing the solvability of systems of equations in one unknown over semigroups of the class $K_{1/3}$ in with overlap of less than $1/3$ in the defining words. Bibliography: 4 titles.
[1] V. A. Tartakovskii, P. V. Stender, “K probleme tozhdestva v polugruppakh”, Matem. sb., 75 (117) (1968), 15–38 | MR | Zbl
[2] V. A. Osipova, “K probleme tozhdestva dlya konechno-opredelennykh polugrupp”, DAN SSSR, 178:5 (1968), 1017–1020 | MR | Zbl
[3] V. A. Osipova, “O probleme sopryazhennosti dlya polugrupp s ogranichennoi meroi naleganiya opredelyayuschikh slov”, Konf. ped. vuzov po algebre i matem. logike, Ivanovo, 1970, 85–86
[4] V. A. Osipova, “Ob uravneniyakh s odnim neizvestnym v polugruppakh s ogranichennoi meroi naleganiya opredelyayuschikh slov”, DAN SSSR, 203:6 (1972), 1252–1254 | MR | Zbl