Geodesic
On a reachability set of automaton 3-counter machines
Modelirovanie i analiz informacionnyh sistem, Tome 16 (2009) no. 3, pp. 77-84.

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

In this paper we prove the existence of automaton 3-counter machines which have non-semilinear reachability sets.
Keywords: abstract counter machines, automaton counter machine, Communicating Colouring Automata, reachability sets, semilinear sets. 
@article{MAIS_2009_16_3_a7,
     author = {E. V. Kuz'min and D. Yu. Chalyi},
     title = {On a reachability set of automaton 3-counter machines},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {77--84},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2009_16_3_a7/}
}
TY  - JOUR
AU  - E. V. Kuz'min
AU  - D. Yu. Chalyi
TI  - On a reachability set of automaton 3-counter machines
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2009
SP  - 77
EP  - 84
VL  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2009_16_3_a7/
LA  - ru
ID  - MAIS_2009_16_3_a7
ER  - 
%0 Journal Article
%A E. V. Kuz'min
%A D. Yu. Chalyi
%T On a reachability set of automaton 3-counter machines
%J Modelirovanie i analiz informacionnyh sistem
%D 2009
%P 77-84
%V 16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2009_16_3_a7/
%G ru
%F MAIS_2009_16_3_a7
E. V. Kuz'min; D. Yu. Chalyi. On a reachability set of automaton 3-counter machines. Modelirovanie i analiz informacionnyh sistem, Tome 16 (2009) no. 3, pp. 77-84. http://geodesic.mathdoc.fr/item/MAIS_2009_16_3_a7/

[1] A. Finkel, G. Sutre, “ An Algorithm Constructing the Semilinear Post* for 2-Dim Reset”, Transfer VASS, In MFCS 2000, LNCS, 1893, Springer, 2000, 353–362 | MR | Zbl

[2] A. Finkel, G. Sutre, “ Decidability of Reachability Problems for Classes of Two-Counter Automata”, In STACS 2000, LNCS, 1770, Springer, 2000, 346–357 | MR | Zbl

[3] J. E. Hopcroft, J. Pansiot, On the Reachability Problem for 5-Dimensional Vector Addition Systems, Computer science technical report, Cornell University, 1976 http://hdl.handle.net/1813/6102

[4] E. V. Kouzmin, V. A. Sokolov, “Communicating Colouring Automata”, Proc. Int. Workshop on Program Understanding (sat. of PSI'03), 2003, 40–46

[5] S. Ginzburg, Matematicheskaya teoriya kontekstno-svobodnykh yazykov, Mir, M., 1970, 328 pp.

[6] E. V. Kuzmin, V. A. Sokolov, “Vzaimodeistvuyuschie raskrashivayuschie protsessy”, Modelirovanie i analiz informatsionnykh sistem, 11:2 (2004), 8–17

[7] E. V. Kuzmin, D. Yu. Chalyi, “Ob odnom klasse schetchikovykh mashin”, Modelirovanie i analiz informatsionnykh sistem, 16:2 (2009), 75–82 | MR

[8] M. Minskii, Vychisleniya i avtomaty, Mir, M., 1971, 268 pp. | MR

[9] R. Mayr, Lossy counter machines, Tech. Report TUM-I9827, Institut für Informatik, TUM, Germany, 1998