|
Modelirovanie i Analiz Informatsionnykh Sistem, 2008, Volume 15, Number 1, Pages 16–26
(Mi mais84)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
On the decidability of boundedness problems for counter Minsky machines
E. V. Kuzmin, D. Ju. Chalyy Yaroslavl State University
Abstract:
In the paper the decidability of boundedness problems for counter Minsky machines is investigated. It is proved, that for Minsky machines with two counters the boundedness is partial decidable, but for the total boundedness problem does not even exist a semidecision algorithm. On the other hand, for one-counter Minsky machines all these problems are polinomial (quantitatively of local machine states) decidable.
Received: 12.02.2008
Citation:
E. V. Kuzmin, D. Ju. Chalyy, “On the decidability of boundedness problems for counter Minsky machines”, Model. Anal. Inform. Sist., 15:1 (2008), 16–26
Linking options:
https://www.mathnet.ru/eng/mais84 https://www.mathnet.ru/eng/mais/v15/i1/p16
|
Statistics & downloads: |
Abstract page: | 228 | Full-text PDF : | 92 | References: | 53 |
|