Related papers: Automatic sequences are orthogonal to aperiodic mu…
In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…
The orbit of a point $x\in X$ in a classical iterated function system (IFS) can be defined as $\{f_u(x)=f_{u_n}\circ\cdots \circ f_{u_1}(x):$ $u=u_1\cdots u_n$ is a word of a full shift $\Sigma$ on finite symbols and $f_{u_i}$ is a…
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
In this article, we prove that for a completely multiplicative function $f$ from $\mathbb{N}^*$ to a field $K$ such that the set $$\{p \;|\; f(p)\neq 1_K \;\mbox{and }p \mbox{ is prime}\}$$ is finite, the asymptotic subword complexity of…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition functions studied by Shallit and Wang, planarity can fail. Let…
We show that indefinite theta series on cones converge and provide an explicit modular completion. Our completion rests on a convolution of the Gaussian with a piecewise constant function supported on the cone. Our main innovation is to…
Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…
We show that automatic sequences are asymptotically orthogonal to periodic exponentials of type $e_q(f(n))$, where $f$ is a rational fraction, in the P\'olya-Vinogradov range. This applies to Kloosterman sums, and may be used to study…
Let ${\mathbb T}=({\bf T},\leq)$ and ${\mathbb T}_{1}=({\bf T}_{1},\leq_{1})$ be linearly ordered sets and $\mathscr{X}$ be a topological space. The main result of the paper is the following: If function $\boldsymbol{f}(t,x):{\bf…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
Let $A$ be a unital $B_{0}$-algebra with an orthogonal basis, then every multiplicative linear functional on $A$ is continuous. This gives an answer to a problem posed by Z. Sawon and Z. Wronski.
Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…
Given a member A of the class of non-deterministic timed automata with silent transitions (eNTA), we effectively compute its timestamp: the set of all pairs (time value, action) of all observable timed traces of A, a generalization of the…
Extensions of {\omega}-automata to infinite alphabets typically rely on symbolic guards to keep the transition relation finite, and on registers or memory cells to preserve information from past symbols. Symbolic transitions alone are…
In their earlier work (Ergodic Th. Dynam. Sys., 34: 1699 -1723, 10 2014), the authors introduced the so called F-aperiodic orbits of a dynamical system on a compact metric space X, which satisfy a quantitative condition measuring its…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
We study Hamiltonian diffeomorphisms of closed symplectic manifolds with non-contractible periodic orbits. In a variety of settings, we show that the presence of one non-contractible periodic orbit of a Hamiltonian diffeomorphism of a…