Abstract
We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and decreasing mode over a given bound. We prove that extended reversal-bounded counter machines also have effective semi-linear reachability sets. We also prove that the property of being reversal-bounded is undecidable in general even when we fix the bound, whereas this problem becomes decidable when considering Vector Addition System with States. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Finkel, A., & Sangnier, A. (2008). Reversal-bounded counter machines revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5162 LNCS, pp. 323–334). https://doi.org/10.1007/978-3-540-85238-4_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
