[책][B] Algebraic combinatorics on words

M Lothaire - 2002 - books.google.com
Combinatorics on words has arisen independently within several branches of mathematics,
for instance, number theory, group theory and probability, and appears frequently in …

[책][B] Topological and symbolic dynamics

P Kurka - 2003 - smf.emath.fr
Mathematical theory of dynamical systems originated in Newton mechanics. In Newton
theory of planetary motions, the sun and the planets are regarded as mass points—particles …

Sturmian and Episturmian Words: (A Survey of Some Recent Results)

J Berstel - International Conference on Algebraic Informatics, 2007 - Springer
This survey paper contains a description of some recent results concerning Sturmian and
episturmian words, with particular emphasis on central words. We list fourteen …

Combinatorics of words

C Choffrut, J Karhumäki - Handbook of Formal Languages: Volume 1 …, 2013 - Springer
The basic object of this chapter is a word, that is a sequence-finite or infinite-of elements
from a finite set. The very definition of a word immediately imposes two characteristic …

[책][B] Markov's theorem and 100 years of the uniqueness conjecture

M Aigner - 2015 - Springer
When you ask different people what they like most about mathematics, you are likely to get
different answers: For some, it is the clarity and beauty of pure reasoning; for others, grand …

[책][B] Combinatorics on words: Christoffel words and repetitions in words

J Berstel - 2009 - books.google.com
The two parts of this text are based on two series of lectures delivered by Jean Berstel and
Christophe Reutenauer in March 2007 at the Centre de Recherches Mathematiques …

[책][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 …

[책][B] Algorithmic combinatorics on partial words

F Blanchet-Sadri - 2007 - taylorfrancis.com
The discrete mathematics and theoretical computer science communities have recently
witnessed explosive growth in the area of algorithmic combinatorics on words. The next …

A characterization of Sturmian words by return words

L Vuillon - European Journal of Combinatorics, 2001 - Elsevier
Sturmian words are infinite words over a binary alphabet with exactly n+ 1 factors of length n
for each n≥ 0 (see [2, 6, 12]). In fact, the study of the Sturmian words appears in many areas …

[HTML][HTML] A combinatorial view on string attractors

S Mantaci, A Restivo, G Romana, G Rosone… - Theoretical Computer …, 2021 - Elsevier
The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in
[Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based …