Related papers: On the Lyndon Dynamical Systems
We introduce a logic, called LT, to express properties of transductions, i.e. binary relations from input to output (finite) words. In LT, the input/output dependencies are modelled via an origin function which associates to any position of…
We show that a shift space on a finite alphabet with a non-uniform specification property can be modeled by a strongly positive recurrent countable-state Markov shift to which every equilibrium state lifts. In addition to uniqueness of the…
If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…
We study dynamical systems with the property that all the nontrivial factors have infinite topological entropy (or, positive mean dimension). We establish an ``if and only if'' condition for this property among a typical class of dynamical…
We show how to use extended word series in the reduction of continuous and discrete dynamical systems to normal form and in the computation of formal invariants of motion in Hamiltonian systems. The manipulations required involve complex…
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…
We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…
A Lie system is a nonautonomous system of first-order differential equations possessing a superposition rule, i.e. a map expressing its general solution in terms of a generic finite family of particular solutions and some constants.…
In this paper we consider the class of lambda-nondeterministic linear automata as a model of the class of linear languages. As usual in other automata models, lambda-moves do not increase the acceptance power. The main contribution of this…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
Anderson transition in three-dimensional systems is investigated using renormalization group theory. $\beta$-function of a very simple form is derived from a self-consistent consideration, and it gives a value $1+1/\sqrt{3}=1.58$ for the…
The structures of full words and non-full for $\beta$-expansions are completely characterized in this paper. We obtain the precise lengths of all the maximal runs of full and non-full words among admissible words with same order.
We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept…
An infinite log-gas formalism, due to Dyson, and independently Fogler and Shklovskii, is applied to the computation of conditioned gap probabilities at the hard and soft edges of random matrix $\beta$-ensembles. The conditioning is that…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
Word embeddings are a powerful approach for unsupervised analysis of language. Recently, Rudolph et al. (2016) developed exponential family embeddings, which cast word embeddings in a probabilistic framework. Here, we develop dynamic…
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…
Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…
Given an order of the underlying alphabet we can lift it to the states of a finite deterministic automaton: to compare states we use the order of the strings reaching them. When the order on strings is the co-lexicographic one \emph{and}…