On the combinatorics of finite words

DOI10.1016/S0304-3975(98)00248-5zbMath0916.68119OpenAlexW2128647267MaRDI QIDQ1292479

Aldo De Luca

Publication date: 21 June 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00248-5

zbMATH Keywords

Sturmian wordsspecial factorssubword complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

The geometric properties of an infinitary line and plane languages, Amendable automaton for the language of finite strings of rectangular hilbert curve, Uniform words, Local periods and binary partial words: an algorithm, On the distribution of characteristic parameters of words, Algorithms for subsequence combinatorics, Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences, Sublinear algorithms for approximating string compressibility, A periodicity result of partial words with one hole, Periods in partial words: an algorithm, An investigation to test spectral segments as bacterial biomarkers, A linear algorithm for string reconstruction in the reverse complement equivalence model, Graph connectivity, partial words, and a theorem of Fine and Wilf, Efficient Reconstruction of RC-Equivalent Strings, Generalized trapezoidal words, Rich, Sturmian, and trapezoidal words, On average sequence complexity, Special factors and the combinatorics of suffix and factor automata, Some characterizations of finite Sturmian words., Compatibility and conjugacy on partial arrays, Words and special factors, A generalized palindromization map in free monoids, Partial words and a theorem of Fine and Wilf revisited, Pseudopalindrome closure operators in free monoids, Rich and Periodic-Like Words, COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES, Complexity for finite factors of infinite sequences, A combinatorial property of the factor poset of a word, Conjugacy on partial words., Semiperiodic words and root-conjugacy., A combinatorial problem on trapezoidal words.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Complexity and special factors
• On bispecial factors of the Thue-Morse word
• On the complexity of infinite sequences
• Some combinatorial properties of Sturmian words
• Sturmian words: structure, combinatorics, and their arithmetics
• Sturmian words, Lyndon words and trees
• On the factors of the Thue-Morse word on three symbols
• On the maximum number of distinct factors of a binary string
• WHICH DISTRIBUTIONS OF MATTER DIFFRACT ? AN INITIAL INVESTIGATION
• A combinatorial theorem on $p$-power-free words and an application to semigroups
• Minimal forbidden words and symbolic dynamics
• Sequences with minimal block growth