Geodesic
On a reachability set of automaton counter machines
Modelirovanie i analiz informacionnyh sistem, Tome 17 (2010) no. 1, pp. 52-64

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

Properties of automaton counter machines are investigated. We prove that reachability sets of automaton one-counter machines are semilinear. An algorithm of construction of these semilinear reachability sets is resulted. Besides, it is shown that reachability sets of reversal-bounded automaton counter machines and reachability sets of flat automaton counter machines are also semilinear.
Keywords: abstract counter machines, automaton counter machine, Communicating Colouring Automata, reachability sets, semilinear sets. 
@article{MAIS_2010_17_1_a3,
     author = {E. V. Kuz'min and D. Yu. Chalyi},
     title = {On a reachability set of automaton counter machines},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {52--64},
     publisher = {mathdoc},
     volume = {17},
     number = {1},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a3/}
}
TY  - JOUR
AU  - E. V. Kuz'min
AU  - D. Yu. Chalyi
TI  - On a reachability set of automaton counter machines
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2010
SP  - 52
EP  - 64
VL  - 17
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a3/
LA  - ru
ID  - MAIS_2010_17_1_a3
ER  - 
%0 Journal Article
%A E. V. Kuz'min
%A D. Yu. Chalyi
%T On a reachability set of automaton counter machines
%J Modelirovanie i analiz informacionnyh sistem
%D 2010
%P 52-64
%V 17
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a3/
%G ru
%F MAIS_2010_17_1_a3
E. V. Kuz'min; D. Yu. Chalyi. On a reachability set of automaton counter machines. Modelirovanie i analiz informacionnyh sistem, Tome 17 (2010) no. 1, pp. 52-64. http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a3/