Related papers: On the Lyndon Dynamical Systems

An S-adic expansion of an infinite word is a way of writing it as the limit of an infinite product of substitutions (i.e., morphisms of a free monoid). Such a description is related to continued fraction expansions of numbers and vectors. A…

Most natural languages have a predominant or fixed word order. For example in English the word order is usually Subject-Verb-Object. This work attempts to explain this phenomenon as well as other typological findings regarding word order…

We consider numeration systems with base $\beta$ and $-\beta$, for quadratic Pisot numbers $\beta$ and focus on comparing the combinatorial structure of the sets $\Z_\beta$ and $\Z_{-\beta}$ of numbers with integer expansion in base…

We completely solve ergodic optimization of a full shift with an uncountable alphabet $[0,1]$, which is one of the most well-known examples of infinite dimensional dynamical systems with positive mean dimension (and thus with infinite…

We consider the distribution of the orbits of the number 1 under the $\beta$-transformations $T_\beta$ as $\beta$ varies. Mainly, the size of the set of $\beta>1$ for which a given point can be well approximated by the orbit of 1 is…

We consider a class of systems over finite alphabets with linear internal dynamics, finite-valued control inputs and finitely quantized outputs. We motivate the need for a new notion of observability and propose three new notions of output…

This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…

It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon…

Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that…

Among all positional numeration systems, the widely studied Bertrand numeration systems are defined by a simple criterion in terms of their numeration languages. In 1989, Bertrand-Mathis characterized them via representations in a real base…

A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words can be used in the distributed control of a set of n weak…

We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…

Let $\phi:X\to \mathbb R$ be a continuous potential associated with a symbolic dynamical system $T:X\to X$ over a finite alphabet. Introducing a parameter $\beta>0$ (interpreted as the inverse temperature) we study the regularity of the…

Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Given a one-dimensional shift $X$, let $|F_X(n)|$ be the number of follower sets of words of length $n$ in $X$, and $|P_X(n)|$ be the number of predecessor sets of words of length $n$ in $X$. We call the sequence $\{|F_X(n)|\}_{n \in…

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,…

For a real number $0<\lambda<2$, we introduce a transformation $T_\lambda$ naturally associated to expansion in $\lambda$-continued fraction, for which we also give a geometrical interpretation. The symbolic coding of the orbits of…

We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

We introduce a family of dynamical systems that generate negative $\beta$-expansions and study the support of the invariant measure which is absolutely continuous with respect to Lebesgue measure. We give a characterization of the set of…