К проблеме редукции $ω$-автоматов
Veroâtnostnye metody i kibernetika, Tome 15 (1979), pp. 61-67
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Mots-clés :
finite state automata, infinite state automata, recognition of words with infinite length, accepted languages
@article{VMK_1979__15_69182,
author = {{\CYRN}.{\CYRR}. {\CYRN}{\cyri}{\cyrg}{\cyrm}{\cyra}{\cyrt}{\cyru}{\cyrl}{\cyrl}{\cyri}{\cyrn}},
title = {{\CYRK} {\cyrp}{\cyrr}{\cyro}{\cyrb}{\cyrl}{\cyre}{\cyrm}{\cyre} {\cyrr}{\cyre}{\cyrd}{\cyru}{\cyrk}{\cyrc}{\cyri}{\cyri} $\ensuremath{\omega}$-{\cyra}{\cyrv}{\cyrt}{\cyro}{\cyrm}{\cyra}{\cyrt}{\cyro}{\cyrv}},
journal = {Vero\^atnostnye metody i kibernetika},
pages = {61--67},
year = {1979},
volume = {15},
zbl = {0422.68026},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMK_1979__15_69182/}
}
Н.Р. Нигматуллин. К проблеме редукции $ω$-автоматов. Veroâtnostnye metody i kibernetika, Tome 15 (1979), pp. 61-67. http://geodesic.mathdoc.fr/item/VMK_1979__15_69182/