We investigate the Membership Problem for hypergeometric sequences: give...
We investigate the complexity of computing the Zariski closure of a fini...
We consider reachability in dynamical systems with discrete linear updat...
We consider the decidability of state-to-state reachability in linear
ti...
The Monniaux Problem in abstract interpretation asks, roughly speaking,
...
We exhibit an algorithm to compute the strongest algebraic (or polynomia...
We present a survey on analog models of computations. Analog can be
unde...
We consider the decidability of state-to-state reachability in linear
ti...
We exhibit an algorithm to compute the strongest polynomial (or algebrai...
The Orbit Problem consists of determining, given a linear
transformation...