On the combinatorics of finite words

From MaRDI portal
Publication:1292479


DOI10.1016/S0304-3975(98)00248-5zbMath0916.68119MaRDI 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


68R15: Combinatorics on words


Related Items

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



Cites Work