On the combinatorics of finite words
From MaRDI portal
Publication:1292479
DOI10.1016/S0304-3975(98)00248-5zbMATH Open0916.68119OpenAlexW2128647267MaRDI QIDQ1292479FDOQ1292479
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- WHICH DISTRIBUTIONS OF MATTER DIFFRACT ? AN INITIAL INVESTIGATION
- A combinatorial theorem on $p$-power-free words and an application to semigroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity and special factors
- On bispecial factors of the Thue-Morse word
- Some combinatorial properties of Sturmian words
- Minimal forbidden words and symbolic dynamics
- On the complexity of infinite sequences
- Sequences with minimal block growth
- On the factors of the Thue-Morse word on three symbols
- On the maximum number of distinct factors of a binary string
Cited In (49)
- Title not available (Why is that?)
- Semiperiodic words and root-conjugacy.
- Rich, Sturmian, and trapezoidal words
- Problems in combinatorics on words originating from discrete dynamical systems
- Counting occurrences for a finite set of words
- On the distribution of characteristic parameters of words
- An investigation to test spectral segments as bacterial biomarkers
- A combinatorial property of the factor poset of a word
- Special factors and the combinatorics of suffix and factor automata
- Title not available (Why is that?)
- Compatibility and conjugacy on partial arrays
- Title not available (Why is that?)
- A generalized palindromization map in free monoids
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
- Partial words and a theorem of Fine and Wilf revisited
- Combinatorial properties of infinite words associated with cut-and-project sequences
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- On factorially balanced sets of words
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Machines, Computations, and Universality
- A periodicity result of partial words with one hole
- A linear algorithm for string reconstruction in the reverse complement equivalence model
- Sublinear algorithms for approximating string compressibility
- Complexity for finite factors of infinite sequences
- Combinatorial properties of smooth infinite words
- Algorithms for subsequence combinatorics
- Rich and Periodic-Like Words
- Conjugacy on partial words.
- Words and special factors
- Pseudopalindrome closure operators in free monoids
- Three distance theorems and combinatorics on words
- Combinatorics, Words and Symbolic Dynamics
- Combinatorics on partial word correlations
- On average sequence complexity
- Amendable automaton for the language of finite strings of rectangular hilbert curve
- Special factors in some combinatorial structures
- Uniform words
- Some characterizations of finite Sturmian words.
- Binomial coefficients and enumeration of restricted words
- Local periods and binary partial words: an algorithm
- Periods in partial words: an algorithm
- Generalized trapezoidal words
- On extended special factors of a word
- The power of commuting with finite sets of words
- Title not available (Why is that?)
- Title not available (Why is that?)
- The geometric properties of an infinitary line and plane languages
- A combinatorial problem on trapezoidal words.
- Efficient Reconstruction of RC-Equivalent Strings
This page was built for publication: On the combinatorics of finite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292479)
