Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDM_2010_4_a6, author = {A. N. Chebotarev}, title = {Regular form of deterministic {FSMs} specifications in the {language~L}}, journal = {Prikladna\^a diskretna\^a matematika}, pages = {64--72}, publisher = {mathdoc}, number = {4}, year = {2010}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDM_2010_4_a6/} }
A. N. Chebotarev. Regular form of deterministic FSMs specifications in the language~L. Prikladnaâ diskretnaâ matematika, no. 4 (2010), pp. 64-72. http://geodesic.mathdoc.fr/item/PDM_2010_4_a6/
[1] Chebotarev A. N., “Ob odnom podkhode k funktsionalnoi spetsifikatsii avtomatnykh sistem. I”, Kibernetika i sistemnyi analiz, 1993, no. 3, 31–42 | MR | Zbl
[2] Chebotarev A. N., “Sintez nedeterminirovannogo avtomata po ego logicheskoi spetsifikatsii. I”, Kibernetika i sistemnyi analiz, 1995, no. 6, 115–127
[3] Gill A., Vvedenie v teoriyu konechnykh avtomatov, Nauka, M., 1966, 227 pp. | MR | Zbl
[4] Chebotarev A. N., “Sintez algoritma po ego logicheskoi spetsifikatsii”, Upravlyayuschie sistemy i mashiny, 2004, no. 5, 53–60
[5] Chebotarev A. N., Kurivchak O. I., “Approksimatsiya mnozhestv sverkhslov formulami yazyka L”, Kibernetika i sistemnyi analiz, 2007, no. 6, 18–26 | MR | Zbl
[6] Chebotarev A. N., Alistratov A. V., “Postroenie logicheskoi spetsifikatsii reaktivnogo algoritma”, Problemy programmirovaniya, 2002, no. 1–2, 154–160 | MR