Geodesic
On the one class of high-level finite automata
Modelirovanie i analiz informacionnyh sistem, Tome 15 (2008) no. 3, pp. 38-46.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper an extension of the hierarchical model of automata based programs is proposed. It allows reducing automata state charts without prejudice to understanding automata based programs logic. 
@article{MAIS_2008_15_3_a3,
     author = {R. A. Vinogradov and V. A. Sokolov},
     title = {On the one class of high-level finite automata},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {38--46},
     publisher = {mathdoc},
     volume = {15},
     number = {3},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2008_15_3_a3/}
}
TY  - JOUR
AU  - R. A. Vinogradov
AU  - V. A. Sokolov
TI  - On the one class of high-level finite automata
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2008
SP  - 38
EP  - 46
VL  - 15
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2008_15_3_a3/
LA  - ru
ID  - MAIS_2008_15_3_a3
ER  - 
%0 Journal Article
%A R. A. Vinogradov
%A V. A. Sokolov
%T On the one class of high-level finite automata
%J Modelirovanie i analiz informacionnyh sistem
%D 2008
%P 38-46
%V 15
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2008_15_3_a3/
%G ru
%F MAIS_2008_15_3_a3
R. A. Vinogradov; V. A. Sokolov. On the one class of high-level finite automata. Modelirovanie i analiz informacionnyh sistem, Tome 15 (2008) no. 3, pp. 38-46. http://geodesic.mathdoc.fr/item/MAIS_2008_15_3_a3/

[1] A. A. Shalyto, Switch-tekhnologiya. Algoritmizatsiya i programmirovanie zadach logicheskogo upravleniya, Nauka, SPb., 1998, 628 pp. http://is.ifmo.ru/books/switch/1/ | Zbl

[2] A. A. Shalyto, N. I. Tukkel, “SWITCH-tekhnologiya – avtomatnyi podkhod k sozdaniyu programmnogo obespecheniya «reaktivnykh» sistem”, Programmirovanie, 2001, no. 5, 45–62 http://is.ifmo.ru/works/switch/1/ | Zbl

[3] E. V. Kuzmin, “Ierarkhicheskaya model avtomatnykh programm”, Modelirovanie i analiz informatsionnykh sistem, 13:1 (2006), 27–34, YarGU, Yaroslavl http://is.ifmo.ru/verification/_hamp.pdf

[4] A. A. Shalyto, N. I. Tukkel, N. N. Shamgunov, “Khanoiskie bashni i avtomaty”, Programmist, 2002, no. 8, 82–90 http://is.ifmo.ru/works/hanoy/

[5] S. G. Volchenkov, Yu. V. Bogomolov, Metody postroeniya effektivnykh algoritmov, Uchebnoe posobie, YarGU, Yaroslavl, 2004, 127 pp.

[6] V. S. Gurov, M. A. Mazin, A. A. Shalyto, “UniMod – Instrumentalnoe sredstvo dlya avtomatnogo programmirovaniya”, Nauchno-tekhnicheskii vestnik. Fundamentalnye i prikladnye issledovaniya informatsionnykh sistem i tekhnologii, 30 (2006), 32–44, SPbGU ITMO http://is.ifmo.ru/works/_instrsr.pdf

[7] R. A. Vinogradov, E. V. Kuzmin, V. A. Sokolov, “Verifikatsiya avtomatnykh programm sredstvami CPN/Tools”, Modelirovanie i analiz informatsionnykh sistem, 13:2 (2006), 4–15 http://is.ifmo.ru/verification/_cpnverif.pdf

[8] R. A. Vinogradov, E. V. Kuzmin, V. A. Sokolov, Sistema modelirovaniya i analiza avtomatnykh programm (svidetelstvo ob ofitsialnoi registratsii programmy dlya EVM), Federalnaya sluzhba po intellektualnoi sobstvennosti, patentam i tovarnym znakam, No 2007611856. Zaregistrirovano v Reestre programm dlya EVM 7 maya 2007 g. Pravoobladatel: Yaroslavskii gosuniversitet im. P. G. Demidova