Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2002_11_a4, author = {L. U. Kasapenko}, title = {Some algorithmic problems of associative algebras}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {36--44}, publisher = {mathdoc}, number = {11}, year = {2002}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_2002_11_a4/} }
L. U. Kasapenko. Some algorithmic problems of associative algebras. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 11 (2002), pp. 36-44. http://geodesic.mathdoc.fr/item/IVM_2002_11_a4/
[1] Umirbaev U. U., “Nekotorye algoritmicheskie voprosy assotsiativnykh algebr”, Algebra i logika, 32:4 (1993), 450–470 | MR | Zbl
[2] Sardinas A., Patterson G., “A nesserary and sufficient condition for the unique decomposition of coded messages”, IRE Intern. conf. record., 8 (1958), 104–108
[3] Salomaa A., Zhemchuzhiny teorii formalnykh yazykov, Mir, M., 1986, 159 pp. | MR
[4] Robbiano L., Sweedler M., “Subalgebra bases”, Comm. algebra, Proc. of the workshop (Federal Univ. of Bahia, Salvador, 1988), Lect. notes Math., 1430, 1990, 61–87 | MR | Zbl
[5] Kapur D., Madlener K., “A completion procedure for computing a canonical basis for a $K$-subalgebra”, Computers and Mathematics (Cambridge, MA), Springer, New York–Berlin, 1989, 1–11 | MR
[6] Iyudu N. K., “Standartnyi bazis i problema vkhozhdeniya v podalgebry svobodnoi assotsiativnoi algebry”, Mezhdunarodn. alg. semin., posv. 70-letiyu kaf. vyssh. alg., Tez. dokl. (Moskva, fevral 1999), Moskva, 1999, 29–31
[7] Latyshev V. N., “An improved version of standard bases”, Proc. of the 12th intern. conf. FPSAC'00 (Moscow, June 26–30, 2000), 496–506 | MR
[8] Gateva-Ivanova T., Latyshev V. N., “On the recognizable properties of assosiative algebras”, On comp. aspects comm. algebras, Special vol. of J.S.C., Acad. Press, London, 1988, 237–254