RUS
ENG
Full version
JOURNALS
// Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
// Archive
Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.,
2019
Number 5,
Pages
44–48
(Mi vmumm3626)
This article is cited in
1
paper
Short notes
The labeling graphs of definite automata
R. A. Ishchenko
Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
The paper describes the algorithm of labelling direct graph's edges so that the obtained transition graph represents a definite automata.
Key words:
definite automata, definite table, transition graph.
UDC:
519
Received:
12.10.2018
Fulltext:
PDF file (2104 kB)
References
Cited by
English version:
Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 2019,
74
:5,
198–201
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026
Fulltext:
PDF file (2104 kB)