Abstract
In the paper, the decidability of boundedness problems for counter Minsky machines is studied. It is proved that, for Minsky machines with two counters, the boundedness problem is partially decidable, and the total boundedness problem is not even partially decidable. On the other hand, for the one-counter Minsky machines, the above problems are decidable for time polynomially depending on the total number of local states of the counter machine.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
