Uniqueness Theorems for Periodic Functions
From MaRDI portal
Publication:5340253
DOI10.2307/2034009zbMATH Open0131.30203OpenAlexW4243237799MaRDI QIDQ5340253FDOQ5340253
Authors: N. J. Fine, Herbert S. Wilf 
Publication date: 1965
Full work available at URL: https://doi.org/10.2307/2034009
Cited In (only showing first 100 items - show all)
- The total run length of a word
- Lyndon words and Fibonacci numbers
- Periods in strings
- On the maximality of languages with combined types of code properties
- Palindromes in circular words
- Local and global cyclicity in free semigroups
- Title not available (Why is that?)
- Combinatorics of periods in strings.
- Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
- Frequencies of factors of Sturmian sequences
- Alternative proof of the Lyndon-Schützenberger theorem
- How many runs can a string contain?
- Partial words and a theorem of Fine and Wilf
- On primitive words with non-primitive product
- The three-squares lemma for partial words with one hole
- Periods and binary words
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- Partial words and a theorem of Fine and Wilf revisited
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Unavoidable languages, cuts and innocent sets of words
- Computing regularities in strings: a survey
- Primitive morphisms
- Real-time streaming string-matching
- Sturmian words: structure, combinatorics, and their arithmetics
- Linear computation of unbordered conjugate on unordered alphabet
- Computing minimal and maximal suffixes of a substring
- On a special class of primitive words
- On a conjecture on bidimensional words.
- On a paper by Castelli, Mignosi, Restivo
- On Critical exponents in fixed points ofk-uniform binary morphisms
- Palindrome complexity.
- Repetitive perhaps, but certainly not boring
- Fine and Wilf words for any periods. II
- The new periodicity lemma revisited
- Random \(\mathbb{Z}^d\)-shifts of finite type
- The theorem of Fine and Wilf for relational periods
- Optimal off-line detection of repetitions in a string
- Random subshifts of finite type
- The three squares lemma revisited
- An extension of the Burrows-Wheeler transform
- A new combinatorial approach to sequence comparison
- An abelian periodicity lemma
- The origins of combinatorics on words
- A new approach to the periodicity lemma on strings with holes
- Some combinatorial properties of Sturmian words
- On generating binary words palindromically
- Inventories of unavoidable languages and the word-extension conjecture
- Towards optimal packed string matching
- Periodicity on partial words
- Intersecting periodic words
- Time-space-optimal string matching
- How many squares can a string contain?
- Longest common extensions in sublinear space
- Local periods and binary partial words: an algorithm
- Primitive partial words
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- Periodicity properties on partial words
- A periodicity lemma for partial words
- On a lemma of Crochemore and Rytter
- Average number of occurrences of repetitions in a necklace
- Circular pattern matching with \(k\) mismatches
- Real-time recognition of substring repetition and reversal
- The ``runs theorem
- Characteristic Sturmian words are extremal for the critical factorization theorem
- Identifying codes on directed de Bruijn graphs
- Distance measures for biological sequences: some recent approaches
- Equations on partial words
- A palindromization map on free monoids
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- Tighter bounds for the sum of irreducible LCP values
- On the maximum number of cubic subwords in a word
- Three overlapping squares: the general case characterized \& applications
- More results on overlapping squares
- On a Special Class of Primitive Words
- Semigroups satisfying x m+n = x n
- Periodicity and repetitions in parameterized strings
- Least Periods of Factors of Infinite Words
- A combinatorial problem on trapezoidal words.
- On Fine and Wilf's theorem for bidimensional words.
- On the factors of automatic words
- A multidimensional critical factorization theorem
- Title not available (Why is that?)
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings
- A coarse-grained multicomputer algorithm for the detection of repetitions
- On the distribution of characteristic parameters of words II
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- Minimal non-convex words
- Finite Completion of comma-free codes Part 2
- Recurrence and periodicity in infinite words from local periods
- Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
- Twin-roots of words and their properties
- On the number of partitions of an integer in the \(m\)-bonacci base
- On suffix extensions in suffix trees
- Periodicities on trees
- Generalised fine and Wilf's theorem for arbitrary number of periods
- Languages under substitutions and balanced words
- Hereditary properties of words
- Unbordered factors and Lyndon words
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)
