Geodesic
The labeling graphs of definite automata
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2019), pp. 44-48

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper describes the algorithm of labelling direct graph's edges so that the obtained transition graph represents a definite automata. 
@article{VMUMM_2019_5_a7,
     author = {R. A. Ishchenko},
     title = {The labeling graphs of definite automata},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {44--48},
     publisher = {mathdoc},
     number = {5},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2019_5_a7/}
}
TY  - JOUR
AU  - R. A. Ishchenko
TI  - The labeling graphs of definite automata
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2019
SP  - 44
EP  - 48
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2019_5_a7/
LA  - ru
ID  - VMUMM_2019_5_a7
ER  - 
%0 Journal Article
%A R. A. Ishchenko
%T The labeling graphs of definite automata
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2019
%P 44-48
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2019_5_a7/
%G ru
%F VMUMM_2019_5_a7
R. A. Ishchenko. The labeling graphs of definite automata. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2019), pp. 44-48. http://geodesic.mathdoc.fr/item/VMUMM_2019_5_a7/