This article is cited 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.

UDC: 519.7

Received: 28.06.2009