scientific article; zbMATH DE number 1737190
This book is a continuation of Lothaire's first book entitled ``Combinatorics on words (1983; Zbl 0514.20045), but it is independent. Compared to the previous one, this book both gives new topics and goes deeper into topics already present before. The first chapter serves as an introduction. The second one is devoted to Sturmian words and Sturmian morphisms, and to their relation to continued fractions. The third chapter concentrates on unavoidable patterns in infinite words. Chapter 4 studies sesquipowers. Chapter 5 addresses the plactic monoid. The sixth chapter is devoted to codes (in the sense of Schützenberger). The seventh one studies numeration systems. Chapter 8 deals with periodicity. Chapter 9 addresses the question of centralizers of non-commutative series and polynomials. Chapter 10 studies transformations on words and \(q\)-calculus. Chapter 11 is devoted to statistics on permutations and words. Chapter 12 deals with Makanin's algorithm. Chapter 13 studies independent systems of equations in semigroups. This book will certainly become a reference book and have the same impact as the first book of Lothaire: essentially self-contained, with many exercises and interesting notes, not mentioning a bibliography with more than 450 items. Finally, note that ``Lothaire is as in the first book -- a collective name, but that the authors are not exactly the same.
- scientific article; zbMATH DE number 1024080
- scientific article; zbMATH DE number 3878866
- scientific article; zbMATH DE number 2183071
- scientific article; zbMATH DE number 2149521
- Combinatorics on words
- scientific article; zbMATH DE number 2155195
- Mini-workshop: Combinatorics on words. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
- scientific article; zbMATH DE number 2108932
- scientific article; zbMATH DE number 3898807
- Words
- Powers of rationals modulo 1 and rational base number systems
- Palindromic richness
- The complexity of nonrepetitive coloring
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- Testing avoidability on sets of partial words is hard
- Burrows-Wheeler transform and Sturmian words
- Infinite periodic points of endomorphisms over special confluent rewriting systems
- Repetitions in beta-integers
- On the dichotomy of Perron numbers and beta-conjugates
- Sturmian substitutions on two letters, cutting paths and their projections
- Cubic pisot unit combinatorial games
- Boundary of central tiles associated with Pisot beta-numeration and purely periodic expansions
- Intersecting periodic words
- Repetitions in strings: algorithms and combinatorics
- Prime and composite integers close to powers of a number
- Everywhere -repetitive sequences and Sturmian words
- On graphs of central episturmian words
- An application of the matrix representation of transductions
- Une généralisation des théorèmes de Higman et de Simon aux mots infinis
- A characterization of power-free morphisms
- Some properties of commutation in free partially commutative monoids
- The Church-Rosser property and special Thue systems
- Square-free words on partially commutative free monoids
- Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
- Special monoids and special Thue systems
- Sur une majoration du nombre de groupes définis par générateurs et ayant une seule relation. (An upper bound for the number of groups defined by generators and only one relator)
- On regular trace languages
- Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
- A formula for iterated derivatives along trajectories of nonlinear systems
- Multidimensional unrepetitive configurations
- Prefixes of infinite words and ambiguous context-free languages
- Avoidable patterns on two letters
- On the generation of powers by OS schemes
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
- Thue-Morse sequence and p-adic topology for the free monoid
- On the conjugation of standard morphisms
- Optimal canonization of all substrings of a string
- Combinatorics of Hall trees and Hall words
- A structure to decide reachability in Petri nets
- On the rank of the subsets of a free monoid
- Optimal parallel detection of squares in strings
- Lyndon trees
- Rationality of division orderings
- Deciding whether a finite set of words has rank at most two
- On two definitions of observation spaces
- A bijective census of nonseparable planar maps
- A complete equational axiomatization for MPA with string iteration
- Commutativity in free inverse monoids
- Periodicity and the golden ratio
- Continuity in a pathwise sense with respect to the coefficients of solutions of stochastic differential equations
- On repetition-free binary words of minimal density
- Descent classes of permutations with a given number of fixed points
- Scattered deletion and commutativity
- Parallel RAM algorithms for factorizing words
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- Lyndon traces and shuffle algebras
- Forbidden subsequences
- The index of Sturmian sequences
- Palindromes in the Fibonacci word
- Over testable languages
- Polynomial closure and unambiguous product
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- Euclidean strings
- Periodicity, morphisms, and matrices.
- On the computational complexity of infinite words.
- Equations in free semigroups with involution and their relation to equations in free groups.
- Hierarchical structures in Sturmian dynamical systems
- Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
- Some properties of the factors of Sturmian sequences.
- Invertible substitutions and Sturmian sequences.
- Combinatorics of periods in strings.
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
- On the independence of equations in three variables.
- Lyndon factorization of the Prouhet words.
- Fine and Wilf words for any periods
- Imbalances in Arnoux-Rauzy sequences
- Repetitiveness of languages generated by morphisms
- Enumeration of planar constellations
- Three distance theorems and combinatorics on words
- Episturmian words and episturmian morphisms
- A combinatorial problem on trapezoidal words.
- Words and forbidden factors
- Some results on k-power-free morphisms
- Balance properties of multi-dimensional words
- Transcendence of Sturmian or morphic continued fractions
- Assigning multiple job types to parallel specialized servers
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- BPS counting for knots and combinatorics on words
- The Frobenius problem for homomorphic embeddings of languages into the integers
- A quantitative shrinking target result on Sturmian sequences for rotations
- Fixed points of Sturmian morphisms and their derivated words
- Partitioned factors in Christoffel and Sturmian words
- Identities in plactic, hypoplactic, sylvester, Baxter, and related monoids
- Sequences, groups, and number theory
- A simple representation of subwords of the Fibonacci word
- Measuring the clustering effect of BWT via RLE
- Avoidability of formulas with two variables
- Knuth's coherent presentations of plactic monoids of type A
- Recurrence and topological entropy of translation operators
- On avoding \(r\)-repetitions in \(\mathbb R^2\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529547)
