We consider a general class of decision problems concerning formal languages, called
“(one-dimensional) unboundedness predicates”, for automata that feature reversal-bounded …

In the past decade, there has been an unprecedented rise in the incorporation of cyber-
physical systems used to perform complex tasks. Verifying these systems is necessary to …

Bounding the number of reversals in a counter machine is one of the most prominent
restrictions to achieve decidability of the reachability problem. Given this success, we …

Counting abilities in finite automata are traditionally provided by two orthogonal extensions:
adding a single counter that can be tested for zeroness at any point, or adding ℤ-valued …

In a separability problem, we are given two sets $ K $ and $ L $ from a class $\mathcal {C} $,
and we want to decide whether there exists a set $ S $ from a class $\mathcal {S} $ such that …

In this paper we go further with the study initiated by Behle, Krebs and Reifferscheid (in:
Proceedings CAI 2011, Lecture Notes in Computer Science, vol 6742, pp 97–114, 2011) …