The labeling graphs of definite automata
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2019), pp. 44-48
Citer cet article
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.
[1] Ischenko R.A., “Grafy gruppovykh avtomatov”, Intellektualnye sistemy, 21:2 (2017), 111–116
[2] Ginzburg A., “About some properties of definite, reverse-definite and related automata”, IEEE Trans. Electronic Computers, 15 (1966), 806–810 | DOI | Zbl
[3] Perles M., Rabin M.O., Shamir E., “Theory of definite automata”, IEEE Trans. Electronic Computers, 12 (1963), 233–243 | DOI | MR | Zbl