An algorithm for establishing the identity of words in a nilpotent product of groups each given by a finite number
Doklady Akademii Nauk, Tome 137 (1961) no. 2, pp. 291-294
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{DAN_1961_137_2_a11,
author = {D. S. Faermark},
title = {An algorithm for establishing the identity of words in a nilpotent product of groups each given by a finite number},
journal = {Doklady Akademii Nauk},
pages = {291--294},
year = {1961},
volume = {137},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1961_137_2_a11/}
}
TY - JOUR AU - D. S. Faermark TI - An algorithm for establishing the identity of words in a nilpotent product of groups each given by a finite number JO - Doklady Akademii Nauk PY - 1961 SP - 291 EP - 294 VL - 137 IS - 2 UR - http://geodesic.mathdoc.fr/item/DAN_1961_137_2_a11/ LA - ru ID - DAN_1961_137_2_a11 ER -
D. S. Faermark. An algorithm for establishing the identity of words in a nilpotent product of groups each given by a finite number. Doklady Akademii Nauk, Tome 137 (1961) no. 2, pp. 291-294. http://geodesic.mathdoc.fr/item/DAN_1961_137_2_a11/