11 research outputs found
Decidability Problems for Self-induced Systems Generated by a Substitution
International audienceIn this talk we will survey several decidability and undecidability results on topological properties of self-affine or self-similar fractal tiles. Such tiles are obtained as fixed point of set equations governed by a graph. The study of their topological properties is known to be complex in general: we will illustrate this by undecidability results on tiles generated by multitape automata. In contrast, the class of self affine tiles called Rauzy fractals is particularly interesting. Such fractals provide geometrical representations of self-induced mathematical processes. They are associated to one-dimensional combinatorial substitutions (or iterated morphisms). They are somehow ubiquitous as self-replication processes appear naturally in several fields of mathematics. We will survey the main decidable topological properties of these specific Rauzy fractals and detail how the arithmetic properties yields by the combinatorial substitution underlying the fractal construction make these properties decidable. We will end up this talk by discussing new questions arising in relation with continued fraction algorithm and fractal tiles generated by S-adic expansion systems
On the decidability of monadic second-order logic with arithmetic predicates
We investigate the decidability of the monadic second-order (MSO) theory of the structure ❬N; The MSO theory of ❬N;
The MSO theory of ❬N;
The MSO theory of ❬N;
The MSO theory of ❬N;
The MSO theory of ❬N;
These results are obtained by exploiting and combining techniques from dynamical systems, number theory, and automata theory
Errata and Addenda to Mathematical Constants
We humbly and briefly offer corrections and supplements to Mathematical
Constants (2003) and Mathematical Constants II (2019), both published by
Cambridge University Press. Comments are always welcome.Comment: 162 page