Beyond substitutive dynamical systems: S-adic expansions
An S-adic expansion of an infinite word is a way of writing it as the limit of an infinite product
of substitutions (ie, morphisms of a free monoid). Such a description is related to continued …
of substitutions (ie, morphisms of a free monoid). Such a description is related to continued …
Abelian combinatorics on words: a survey
We survey known results and open problems in abelian combinatorics on words. Abelian
combinatorics on words is the extension to the commutative setting of the classical theory of …
combinatorics on words is the extension to the commutative setting of the classical theory of …
[BUCH][B] Topological and ergodic theory of symbolic dynamics
H Bruin - 2022 - books.google.com
Symbolic dynamics is essential in the study of dynamical systems of various types and is
connected to many other fields such as stochastic processes, ergodic theory, representation …
connected to many other fields such as stochastic processes, ergodic theory, representation …
On the Pisot substitution conjecture
Our goal is to present a unified and reasonably complete account of the various conjectures,
known as Pisot conjectures, that assert that certain dynamical systems arising from …
known as Pisot conjectures, that assert that certain dynamical systems arising from …
Acyclic, connected and tree sets
Given a set SS of words, one associates to each word ww in SS an undirected graph, called
its extension graph, and which describes the possible extensions of ww in SS on the left and …
its extension graph, and which describes the possible extensions of ww in SS on the left and …
[BUCH][B] Formal languages, automata and numeration systems 1: Introduction to combinatorics on words
M Rigo - 2014 - books.google.com
Formal Languages, Automaton and Numeration Systems presents readers with a review of
research related to formal language theory, combinatorics on words or numeration systems …
research related to formal language theory, combinatorics on words or numeration systems …
String Attractors of Fixed Points of k-Bonacci-Like Morphisms
Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms,
string attractors have become a compelling object of theoretical research within the …
string attractors have become a compelling object of theoretical research within the …
On the dimension group of unimodular -adic subshifts
Dimension groups are complete invariants of strong orbit equivalence for minimal Cantor
systems. This paper studies a natural family of minimal Cantor systems having a finitely …
systems. This paper studies a natural family of minimal Cantor systems having a finitely …
[HTML][HTML] Computing the k-binomial complexity of the Thue–Morse word
Two words are k-binomially equivalent whenever they share the same subwords, ie,
subsequences, of length at most k with the same multiplicities. This is a refinement of both …
subsequences, of length at most k with the same multiplicities. This is a refinement of both …
[BUCH][B] Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability
M Rigo - 2014 - books.google.com
The interplay between words, computability, algebra and arithmetic has now proved its
relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite …
relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite …