We show that computing the strongest polynomial invariant for single-path loops with
polynomial assignments is at least as hard as the Skolem problem, a famous problem …

This paper introduces a new automata-theoretic class of string-to-string functions with
polynomial growth. Several equivalent definitions are provided: a machine model which is a …

A sequence is called C-finite, if it satisfies a linear recurrence with constant coefficients and
holonomic, if it satisfies a linear recurrence with polynomial coefficients. The class of C2 …

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 …

We study the class of rational recursive sequences (ratrec) over the rational numbers. A
ratrec sequence is defined via a system of sequences using mutually recursive equations of …

A sequence $ s (n) $ of integers is MC-finite if for every $ m\in\mathbb {N}^+ $ the sequence
$ s^ m (n)= s (n)\bmod {m} $ is ultimately periodic. We discuss various ways of proving and …

We study weighted basic parallel processes (WBPP), a nonlinear recursive generalisation of
weighted finite automata inspired from process algebra and Petri net theory. Our main result …

We show that computing the strongest polynomial invariant for single-path loops with
polynomial assignments is at least as hard as the Skolem problem, a famous problem …

This paper introduces a new automata-theoretic class of string-to-string functions with
polynomial growth. Several equivalent definitions are provided: a machine model which is a …

We study the computational complexity of universality and inclusion problems for
unambiguous finite automata and context-free grammars. We observe that several such …