A criterion for a partial prediction of general regular superevents
Diskretnaya Matematika, Tome 23 (2011) no. 4, pp. 103-114
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Trakhtenbrot B. A., Bardzin Ya. M., Konechnye avtomaty (povedenie i sintez), Nauka, Moskva, 1970 | MR | Zbl
[2] Verenikin A. G., Gasanov E. E., “Ob avtomatnoi determinizatsii mnozhestv sverkhslov”, Diskretnaya matematika, 18:2 (2006), 84–97 | MR | Zbl
[3] Mastikhina A. A., “O chastichnom ugadyvanii sverkhslov”, Intellektualnye sistemy, 11 (2007), 609–619 | MR
[4] Sedgewick R., Algorithms in C++. Part 5: Graph algorithms, Addison–Wesley, Reading, Mass., 2001
[5] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, Moskva, 1985 | MR | Zbl