Geodesic
Recognition of definability of automata monomial algebras
Fundamentalʹnaâ i prikladnaâ matematika, Tome 1 (1995) no. 3, pp. 805-807.

Voir la notice de l'article provenant de la source Math-Net.Ru

An algorithm to recognize the finite definability of an automatic monomial algebra is obtained. 
@article{FPM_1995_1_3_a15,
     author = {E. V. Lukoyanova},
     title = {Recognition of definability of automata monomial algebras},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {805--807},
     publisher = {mathdoc},
     volume = {1},
     number = {3},
     year = {1995},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_1995_1_3_a15/}
}
TY  - JOUR
AU  - E. V. Lukoyanova
TI  - Recognition of definability of automata monomial algebras
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 1995
SP  - 805
EP  - 807
VL  - 1
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_1995_1_3_a15/
LA  - ru
ID  - FPM_1995_1_3_a15
ER  - 
%0 Journal Article
%A E. V. Lukoyanova
%T Recognition of definability of automata monomial algebras
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 1995
%P 805-807
%V 1
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_1995_1_3_a15/
%G ru
%F FPM_1995_1_3_a15
E. V. Lukoyanova. Recognition of definability of automata monomial algebras. Fundamentalʹnaâ i prikladnaâ matematika, Tome 1 (1995) no. 3, pp. 805-807. http://geodesic.mathdoc.fr/item/FPM_1995_1_3_a15/

[1] Ufnarovskii V. A., “Kombinatornye i asimptoticheskie metody v algebre”, Itogi nauki i tekhniki Ser. Sovremennye problemy matematiki, 57, M., 1990, 5–177 | MR

[2] Ufnarovskii V. A., “Ob ispolzovanii grafov dlya vychisleniya bazisa, rosta i ryada Gilberta assotsiativnykh algebr”, Mat. sb., 180:11 (1989), 1548–1555