The main goal DynAMiCs is to achieve major advances in the algorithmic theory of discrete linear dynamical systems and related formalisms. Whilst our motivation and outlook originate from computer science and automated verification, we approach these challenging problems from both mathematical and computational angles, combining tools and techniques from number theory (e.g. Diophantine approximation, transcendence theory, continued fractions), symbolic dynamics (e.g. word combinatorics, subshifts, numeration systems), and mathematical logic (e.g. monadic second-order logic, Presburger arithmetic, automata theory).

One of our leading objectives is to substantially broaden the classes of dynamical systems and properties that can be algorithmically handled via model checking. We aim to achieve these ambitious advances by pursuing new approaches to central open problems in linear systems, such as the Skolem Problem, building on recent breakthroughs in these areas (some of which from the PIs and their groups). We take on this challenge with a team of PIs consisting of international leaders in algorithmic verification, symbolic dynamics, and analytic number theory. We believe our complementary expertise places us in a unique position to achieve major breakthroughs in longstanding fundamental problems in the area of discrete dynamical systems.

We take on this challenge with a team of PIs consisting of international leaders in algorithmic verification, symbolic dynamics, and analytic number theory. We believe our complementary expertise places us in a unique position to achieve major breakthroughs in longstanding fundamental problems in the area of discrete dynamical systems.