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