Boundedness problems for Minsky counter machines

Authors:
E. V. Kuzmin;V. A. Sokolov;D. Yu. Chalyy
Affiliations:
Yaroslavl State University, Yaroslavl, Russia 150000;Yaroslavl State University, Yaroslavl, Russia 150000;Yaroslavl State University, Yaroslavl, Russia 150000
Venue:
Programming and Computing Software
Year:
2010

Citing 4
Cited 0

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On validation of XML streams using finite state machines

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Model checking freeze LTL over one-counter automata

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Intruder deduction for AC-like equational theories with homomorphisms

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

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.