On a reachability set of automaton 3-counter machines

Modelirovanie i Analiz Informacionnyh Sistem

D. J. Chalyy¹  E. V. Kuzmin¹ 

[1]Ярославский государственный университет им. П.Г. Демидова

关键词: abstract counter machines;    automaton counter machine;    communicating colouring automata;    reachability sets;    semilinear sets;   

DOI  :  

来源: DOAJ

【 摘 要 】

In this paper we prove the existence of automaton 3-counter machines which have non-semilinear reachability sets.

【 授权许可】

Unknown