Related papers: Automatic sequences are orthogonal to aperiodic mu…

Let $X$ be a regular curve and let $f: X\to X$ be a monotone map. In this paper, nonwandering set of $f$ and the structure of special $\alpha$-limit sets for $f$ are investigated. We show that AP$(f)= \textrm{R}(f) =\Omega(f)$, where…

Macroscopic observables in a quantum spin system are given by sequences of spatial means of local elements $\frac{1}{2n+1}\sum_{j=-n}^n\gamma_j(A_{i}), \; n\in{\mathbb N},\; i=1,...,m$ in a UHF algebra. One of their properties is that they…

Let $\Delta\subsetneq\V$ be a proper subset of the vertices $\V$ of the defining graph of an aperiodic shift of finite type $(\Sigma_{A}^{+},\S)$. Let $\Delta_{n}$ be the union of cylinders in $\Sigma_{A}^{+}$ corresponding to the points…

We study finite transitive permutation groups $G\leqslant\operatorname{Sym}(\Omega)$ such that all orbits of the conjugation action on $G$ of the normaliser of $G$ in $\operatorname{Sym}(\Omega)$ have size bounded by some constant. Our…

Jumping automata are finite automata that read their input in a non-consecutive manner, disregarding the order of the letters in the word. We introduce and study jumping automata over infinite words. Unlike the setting of finite words,…

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of…

We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…

Let $f\colon \mathbb{T}\to \mathbb{R}$ be of class $C^{1+\delta}$ for some $\delta>0$ and let $c\in\mathbb{Z}$. We show that for a generic $\alpha\in\mathbb{R}$, the extension $T_{c,f}\colon \mathbb{T}^2\to\mathbb{T}^2$ of the irrational…

A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…

A function $J$ defined on a family $C$ of stationary processes is finitely observable if there is a sequence of functions $s_n$ such that $s_n(x_1 ... x_n)\to J(X)$ in probability for every process $X=(x_n)\in C$. Recently, Ornstein and…

In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…

We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…

This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for computing or approximating the set of…

By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting. For this, weighted automata…

Let $\phi_1,\ldots,\phi_n:[0,1]\to (0,1)$ be Lipschitz contractions. Let $I=[0,1)$, $x_0=0$ and $x_n=1$. We prove that for Lebesgue almost every $(x_1,...,x_{n-1})$ satisfying $0<x_1<\cdots <x_{n-1}<1$, the piecewise contraction $f:I\to I$…

Every automaton group naturally acts on the space $X^\omega$ of infinite sequences over some alphabet $X$. For every $w\in X^\omega$ we consider the Schreier graph $\Gamma_w$ of the action of the group on the orbit of $w$. We prove that for…

We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is an f:R-> omega with |S_x| <= 1 for every x in R. If the…

The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…

We form a sequence of oblong matrices by evaluating an integrable vector-valued function along the orbit of an ergodic dynamical system. We obtain an almost sure asymptotic result for the permanents of those matrices. We also give an…