Issledovaniya po Prikladnoi Matematike i Informatike, Issledovaniya po Prikladnoi Matematike, Tome 20 (1992) no. 20, pp. 13-17
Citer cet article
N. Z. Gabbasov. On the algorithmic recognition of the codability property of infinite languages. Issledovaniya po Prikladnoi Matematike i Informatike, Issledovaniya po Prikladnoi Matematike, Tome 20 (1992) no. 20, pp. 13-17. http://geodesic.mathdoc.fr/item/KUIPM_1992_20_20_a2/
@article{KUIPM_1992_20_20_a2,
author = {N. Z. Gabbasov},
title = {On the algorithmic recognition of the codability property of infinite languages},
journal = {Issledovaniya po Prikladnoi Matematike i Informatike},
pages = {13--17},
year = {1992},
volume = {20},
number = {20},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/KUIPM_1992_20_20_a2/}
}
TY - JOUR
AU - N. Z. Gabbasov
TI - On the algorithmic recognition of the codability property of infinite languages
JO - Issledovaniya po Prikladnoi Matematike i Informatike
PY - 1992
SP - 13
EP - 17
VL - 20
IS - 20
UR - http://geodesic.mathdoc.fr/item/KUIPM_1992_20_20_a2/
LA - ru
ID - KUIPM_1992_20_20_a2
ER -
%0 Journal Article
%A N. Z. Gabbasov
%T On the algorithmic recognition of the codability property of infinite languages
%J Issledovaniya po Prikladnoi Matematike i Informatike
%D 1992
%P 13-17
%V 20
%N 20
%U http://geodesic.mathdoc.fr/item/KUIPM_1992_20_20_a2/
%G ru
%F KUIPM_1992_20_20_a2
