Results 111 to 120 of about 70,377,857 (147)
Combinatorics on words: Christoffel words and repetitions in words
, 2008 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 Mathématiques, Montréal, Canada.
Reutenauer, Christophe +3 more
core
Nonlinear Control and Combinatorics of Words
, 1997 This article attempts to bring together some problems in nonlinear control systems and in algebraic combinatorics of words. One the control side recent results in controllability, nilpotent approximating systems, and applications to path planning are ...
Matthias Kawski
core
Parry’s 1960 theorem and some applications in combinatorics on words [PDF]
To manipulate numbers, we need to represent them. A numeration system is nothing but a set of rules that enables us to write each number as a sequence of symbols belonging to an alphabet of digits.
Stipulanti, Manon
core +1 more source
Algebraic Combinatorics on Words
, 2002 Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book
Lothaire, M, Lothaire, M.
exaly +4 more sources
On the Combinatorics of Finite Words
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aldo De Luca
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Algorithmic Combinatorics on Partial Words
International Journal of Foundations of Computer Science, 2012Algorithmic combinatorics on partial words, or sequences of symbols over a finite alphabet that may have some do-not-know symbols or holes, has been developing in the past few years. Applications can be found, for instance, in molecular biology for the sequencing and analysis of DNA, in bio-inspired computing where partial words have been considered ...
F Blanchet-Sadri
exaly +3 more sources
Combinatorics on Words and Generating Dirichlet Series of Automatic Sequences [PDF]
Discrete MathematicsGenerating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential generating ...
Manon Stipulanti +2 more
exaly +2 more sources
1999
The combinatorics of finite, as well as infinite, sequences of symbols (words) over a finite set can be considered at the present time as an independent mathematical topic which has arisen in such diverse fields as logic, algebra, physics, computer science, and, more recently, biology.
Aldo de Luca, Stefano Varricchio
openaire +1 more source
The combinatorics of finite, as well as infinite, sequences of symbols (words) over a finite set can be considered at the present time as an independent mathematical topic which has arisen in such diverse fields as logic, algebra, physics, computer science, and, more recently, biology.
Aldo de Luca, Stefano Varricchio
openaire +1 more source