Algorithms for the boundedness problem for Minsky counter machines

Abstract

In this paper, algorithms that can be applied for solving the boundedness problem for Minsky counter machines are discussed. We introduce a polynomial-time algorithm that solves the boundedness problem for one-counter machines using memory commensurate with the memory required for the machine representation. 
DOI: 10.3103/S0146411610070011

Topics

3 Figures and Tables

Cite this paper

@article{Kuzmin2010AlgorithmsFT, title={Algorithms for the boundedness problem for Minsky counter machines}, author={E. V. Kuzmin and D. Ju. Chalyy}, journal={Automatic Control and Computer Sciences}, year={2010}, volume={44}, pages={365-373} }