Metrization criterion for regularity of languages representable in countable automata
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (1982), pp. 67-69
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_1982_9_a11,
author = {F. M. Ablayev},
title = {Metrization criterion for regularity of languages representable in countable automata},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {67--69},
publisher = {mathdoc},
number = {9},
year = {1982},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_1982_9_a11/}
}
TY - JOUR AU - F. M. Ablayev TI - Metrization criterion for regularity of languages representable in countable automata JO - Izvestiâ vysših učebnyh zavedenij. Matematika PY - 1982 SP - 67 EP - 69 IS - 9 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/IVM_1982_9_a11/ LA - ru ID - IVM_1982_9_a11 ER -
F. M. Ablayev. Metrization criterion for regularity of languages representable in countable automata. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (1982), pp. 67-69. http://geodesic.mathdoc.fr/item/IVM_1982_9_a11/