Related papers: On the Lyndon Dynamical Systems
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…
Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in…
The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product…
The general relation between the standard expansion coefficients and the beta function for the QCD coupling is exactly derived in a mathematically strict way. It is accordingly found that an infinite number of logarithmic terms are lost in…
Smooth words over an alphabet of non-negative integers $\{a,b\}$ are infinite words that are infinitely derivable, the most famous example being the Oldenburger-Kolakoski word over $\{1,2\}$. The main way to study their language is to…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…
We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…
This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…
The subshift of finite type property (also known as the Markov property) is ubiquitous in dynamical systems and the simplest and most widely studied class of dynamical systems are $\beta$-shifts, namely transformations of the form…
We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…
Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.
We generalize the greedy and lazy $\beta$-transformations for a real base $\beta$ to the setting of alternate bases $\boldsymbol{\beta}=(\beta_0,\ldots,\beta_{p-1})$, which were recently introduced by the first and second authors as a…
Given a real number $ \beta > 1$, we study the associated $ (-\beta)$-shift introduced by S. Ito and T. Sadahiro. We compares some aspects of the $(-\beta)$-shift to the $\beta$-shift. When the expansion in base $ -\beta $ of $…
Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…
The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…
A new class of random quantum--dynamical systems in continuous space is introduced and studied in some detail. Each member of the class is characterized by a Hamiltonian which is the sum of two parts. While one part is deterministic,…
Let $\beta>1$ be a real number and define the $\beta$-transformation on $[0,1]$ by $T_\beta:x\mapsto \beta x\bmod 1$. Further, define $$W_y(T_{\beta},\Psi):=\{x\in [0, 1]:|T_\beta^nx-y|<\Psi(n) \mbox{ for infinitely many $n$}\}$$ and…
For some fixed alphabet A, a language L of A* is in the class L(1/2) of the Straubing-Therien hierarchy if and only if it can be expressed as a finite union of languages A*aA*bA*...A*cA*, where a,b,...,c are letters. The class L(1) is…