Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Trakhtenbrot B. A., Barzdin Ya. M., Konechnye avtomaty (povedenie i sintez), Nauka, Moskva, 1970 | MR | Zbl
[2] Burks A. W., Wright J. B., “Theory of logical nets”, Proc. IRE, 41 (1953), 1357–1365 | DOI | MR | Zbl
[3] Kobrinskii N. E., Trakhtenbrot B. A., Vvedenie v teoriyu konechnykh avtomatov, Fizmatgiz, Moskva, 1962
[4] Babash A. V., “O periodichnosti posledovatelnosti sostoyanii avtomata, otvechayuschei ego nachalnomu sostoyaniyu i vkhodnoi periodicheskoi posledovatelnosti”, Diskretnaya matematika, 14:2 (2002), 54–64 | MR | Zbl
[5] Hibbard T. H., “Least upper bounds on minimal terminal state experiments for two classes of sequential machines”, J. Assoc. Comput. Mach., 8 (1961), 601–612 | Zbl
[6] Gill A., Vvedenie v teoriyu konechnykh avtomatov, Nauka, Moskva, 1966 | MR | Zbl
[7] Korshunov A. D., “O verkhnei otsenke dlin kratchaishikh odnorodnykh eksperimentov po raspoznavaniyu zaklyuchitelnogo sostoyaniya dlya pochti vsekh avtomatov”, Dokl. AN SSSR, 184 (1969), 28–29
[8] Korshunov A. D., “Ob asimptoticheskikh otsenkakh chisla privedennykh konechnykh avtomatov”, Diskretnyi analiz, 6 (1966), 35–50
[9] Babash A. V., “Isoperiods of output sequences of automata”, Probabilistic Methods in Discrete Mathematics, eds. Kolchin V. F. et al., VSP, Utrecht, 2002, 147–158