Determinism of devices is a key aspect throughout all of computer science, simply because
of considerations of efficiency of the implementation. One possible way (among others) to …

Parikh automata extend finite automata by counters that can be tested for membership in a
semilinear set, but only at the end of a run. Thereby, they preserve many of the desirable …

Parikh automata extend finite automata by counters that can be tested for membership in a
semilinear set, but only at the end of a run, thereby preserving many of the desirable …

We study the reachability problem for affine Z-VASS, which are integer vector addition
systems with states in which transitions perform affine transformations on the counters. This …

We consider the problems of language inclusion and language equivalence for Vector
Addition Systems with States (VASSes) with the acceptance condition defined by the set of …

We investigate a subclass of languages recognized by vector addition systems, namely
languages of nondeterministic Parikh automata. While the regularity problem (is the …

Automata theory has given rise to a variety of automata models that consist of a finite-state
control and an infinite-state storage mechanism. The aim of this work is to provide insights …

We study the universality and inclusion problems for register automata over equality data.
We show that the universality and the inclusion problems can be solved with 2-EXPTIME …

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 …

We investigate the connection between properties of formal languages and properties of
their generating series, with a focus on the class of\emph {holonomic} power series. We first …