Uniqueness Theorems for Periodic Functions
From MaRDI portal
Publication:5340253
Cited in
(only showing first 100 items - show all)- Primitive partial words
- Three overlapping squares: the general case characterized \& applications
- Some combinatorial properties of Sturmian words
- On a lemma of Crochemore and Rytter
- Partial words and a theorem of Fine and Wilf revisited
- On generating binary words palindromically
- Equations on partial words
- A new combinatorial approach to sequence comparison
- On a conjecture on bidimensional words.
- Average number of occurrences of repetitions in a necklace
- Unavoidable languages, cuts and innocent sets of words
- On primitive words with non-primitive product
- A combinatorial problem on trapezoidal words.
- How many squares can a string contain?
- The total run length of a word
- Periodicity on partial words
- Lyndon words and Fibonacci numbers
- Circular pattern matching with \(k\) mismatches
- Computing regularities in strings: a survey
- On Fine and Wilf's theorem for bidimensional words.
- Primitive morphisms
- Longest common extensions in sublinear space
- An abelian periodicity lemma
- Periodicity properties on partial words
- Periods in strings
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words
- The ``runs theorem
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- Fine and Wilf words for any periods. II
- A palindromization map on free monoids
- More results on overlapping squares
- Real-time streaming string-matching
- On Critical exponents in fixed points ofk-uniform binary morphisms
- Distance measures for biological sequences: some recent approaches
- On the maximum number of cubic subwords in a word
- The three-squares lemma for partial words with one hole
- On a special class of primitive words
- On a Special Class of Primitive Words
- The theorem of Fine and Wilf for relational periods
- Optimal off-line detection of repetitions in a string
- Semigroups satisfying x m+n = x n
- Palindrome complexity.
- On the maximality of languages with combined types of code properties
- Palindromes in circular words
- On a paper by Castelli, Mignosi, Restivo
- Intersecting periodic words
- Sturmian words: structure, combinatorics, and their arithmetics
- Random subshifts of finite type
- The three squares lemma revisited
- Periods and binary words
- Time-space-optimal string matching
- Inventories of unavoidable languages and the word-extension conjecture
- Alternative proof of the Lyndon-Schützenberger theorem
- Local and global cyclicity in free semigroups
- Characteristic Sturmian words are extremal for the critical factorization theorem
- The origins of combinatorics on words
- Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
- The new periodicity lemma revisited
- A new approach to the periodicity lemma on strings with holes
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- Random \(\mathbb{Z}^d\)-shifts of finite type
- Partial words and a theorem of Fine and Wilf
- On the factors of automatic words
- Frequencies of factors of Sturmian sequences
- Towards optimal packed string matching
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Repetitive perhaps, but certainly not boring
- A periodicity lemma for partial words
- scientific article; zbMATH DE number 7559452 (Why is no real title available?)
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- Tighter bounds for the sum of irreducible LCP values
- Linear computation of unbordered conjugate on unordered alphabet
- Periodicity and repetitions in parameterized strings
- Computing minimal and maximal suffixes of a substring
- Combinatorics of periods in strings.
- Real-time recognition of substring repetition and reversal
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Identifying codes on directed de Bruijn graphs
- How many runs can a string contain?
- Local periods and binary partial words: an algorithm
- An extension of the Burrows-Wheeler transform
- Least Periods of Factors of Infinite Words
- scientific article; zbMATH DE number 3693557 (Why is no real title available?)
- Generalised fine and Wilf's theorem for arbitrary number of periods
- Languages under substitutions and balanced words
- Prefix frequency of lost positions
- On the distribution of characteristic parameters of words II
- On the Shyr-Yu theorem
- The extended equation of Lyndon and Schützenberger
- Some Algebraic Properties of Machine Poset of Infinite Words
- A multidimensional critical factorization theorem
- Repetition Detection in a Dynamic String
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings
- A coarse-grained multicomputer algorithm for the detection of repetitions
- Combinatorics on partial word correlations
- Periodicity and roots of transfinite strings
- On primary and secondary repetitions in words
- Maximal prefix products
- Marcus contextual languages consisting of primitive words
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)
This page was built for publication: Uniqueness Theorems for Periodic Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5340253)