Geodesic
On the algorithmic recognition of the codability property of infinite languages
Issledovaniya po Prikladnoi Matematike i Informatike, Issledovaniya po Prikladnoi Matematike (1992), pp. 13-17 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

@article{KUIPM_1992_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},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/KUIPM_1992_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
UR  - http://geodesic.mathdoc.fr/item/KUIPM_1992_a2/
LA  - ru
ID  - KUIPM_1992_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
%U http://geodesic.mathdoc.fr/item/KUIPM_1992_a2/
%G ru
%F KUIPM_1992_a2
N. Z. Gabbasov. On the algorithmic recognition of the codability property of infinite languages. Issledovaniya po Prikladnoi Matematike i Informatike, Issledovaniya po Prikladnoi Matematike (1992), pp. 13-17. http://geodesic.mathdoc.fr/item/KUIPM_1992_a2/