|
Modelirovanie i Analiz Informatsionnykh Sistem, 2009, Volume 16, Number 3, Pages 77–84
(Mi mais65)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On a reachability set of automaton 3-counter machines
E. V. Kuz'min, D. Yu. Chalyi P. G. Demidov Yaroslavl State University
Abstract:
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.
Received: 28.06.2009
Citation:
E. V. Kuz'min, D. Yu. Chalyi, “On a reachability set of automaton 3-counter machines”, Model. Anal. Inform. Sist., 16:3 (2009), 77–84
Linking options:
https://www.mathnet.ru/eng/mais65 https://www.mathnet.ru/eng/mais/v16/i3/p77
|
Statistics & downloads: |
Abstract page: | 280 | Full-text PDF : | 82 | References: | 58 |
|