Sturmian words, Lyndon words and trees

DOI10.1016/S0304-3975(96)00101-6zbMath0901.68155WikidataQ59487320 ScholiaQ59487320MaRDI QIDQ1391533

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00101-6

zbMATH Keywords

binary trees; combinatorial properties

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

On a graph connecting hyperbinary expansions, An alternative approach to generalized Pythagorean scales. Generation and properties derived in the frequency domain, Second Order Balance Property on Christoffel Words, The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness, Standard factors of Sturmian words, On a group theoretic generalization of the Morse-Hedlund theorem, Combinatorial View of Digital Convexity, On Sturmian and episturmian words, and related topics, A characterization of Sturmian words by return words, Convexity preserving deformations of digital sets: characterization of removable and insertable pixels, Cluster duality between Calkin-Wilf tree and Stern-Brocot tree, An output-sensitive algorithm to compute the normal vector of a digital plane, Markov word patterns and a relation on \(\alpha\)-words, Reversible Christoffel factorizations, Lyndon words and Fibonacci numbers, A standard correspondence on epicentral words, On generating binary words palindromically, Minimal non-convex words, Factors of characteristic words of irrational numbers, A periodicity result of partial words with one hole, \(\alpha\)-words and the radix order, On Christoffel and standard words and their derivatives, Two linear-time algorithms for computing the minimum length polygon of a digital contour, Novel results on the number of runs of the Burrows-Wheeler-transform, Lyndon + Christoffel = digitally convex, Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words, On a generalization of Christoffel words: epichristoffel words, Farey codes and languages, On prefixal factorizations of words, Graph connectivity, partial words, and a theorem of Fine and Wilf, Substitutions on two letters, cutting segments and their projections, Involutions of epicentral words, Sturmian morphisms, the braid group \(B_4\), Christoffel words and bases of \(F_2\), A conjecture on continued fractions, On the combinatorics of finite words, Lyndon words and singular factors of sturmian words, Fine and Wilf's theorem for three periods and a generalization of Sturmian words, Viennot factorization of infinite words, Standard Sturmian morphisms, Euclidean strings, Lyndon factorization of the Prouhet words., A combinatorial problem on trapezoidal words., On low-complexity bi-infinite words and their factors, Periodic scheduling of marked graphs using balanced binary words, Harmonic and gold Sturmian words, Moments of conjugacy classes of binary words, Palindromes and Sturmian words, Sturmian morphisms and \(\alpha\)-words, A characterization of Sturmian sequences by indistinguishable asymptotic pairs, Further steps on the reconstruction of convex polyominoes from orthogonal projections, Perfectly clustering words are primitive positive elements of the free group, A combinatorial view on string attractors, Multiplicative analogue of Markoff-Lagrange spectrum and Pisot numbers, Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words, Analytical description of digital intersections: minimal parameters and multiscale representation, Sturmian words and the Stern sequence, Studies on finite Sturmian words, Reversals and palindromes in continued fractions, A geometrical characterization of factors of multidimensional billiard words and some applications, Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators, Counting Lyndon factors, On an involution of Christoffel words and Sturmian morphisms, Codes of central Sturmian words, Palindromic factors of billiard words, Some characterizations of finite Sturmian words., A palindromization map on free monoids, On the structure of bispecial Sturmian words, Christoffel Words and Markoff Triples: An Algebraic Approach, SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD, Plain and Twisted Adjoints of Well-Formed Words, Regions and Standard Modes, MINIMAL DUVAL EXTENSIONS, On Christoffel classes, Sturmian and Episturmian Words, Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour, Ionian theorem

Cites Work