|
|
Modelirovanie i Analiz Informatsionnykh Sistem, 2008, Volume 15, Number 4, Pages 42–55
(Mi mais115)
|
|
|
|
Algorithms for the boundedness problem for Minsky counter machines
E. V. Kuzmin, D. Ju. Chalyy Yaroslavl State University
Abstract:
In the paper, the algorithms that can be applied to solving the boundedness problem for Minsky counter machines are discussed. We introduce a polinomial-time algorithm that solves the boundedness problem for one-counter machines using the memory commensurate with the memory required for a machine representation.
Keywords:
Minsky counter machines, boundedness problem, algorithm of the search of a cycle in a periodic sequence, model verification.
Received: 02.11.2008
Citation:
E. V. Kuzmin, D. Ju. Chalyy, “Algorithms for the boundedness problem for Minsky counter machines”, Model. Anal. Inform. Sist., 15:4 (2008), 42–55
Linking options:
https://www.mathnet.ru/eng/mais115 https://www.mathnet.ru/eng/mais/v15/i4/p42
|
| Statistics & downloads: |
| Abstract page: | 339 | | Full-text PDF : | 137 | | References: | 67 |
|