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)
- 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
- On some combinatorial problems in free monoids
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Maximal prefix products
- Distinct squares in circular words
- Formalizing a fragment of combinatorics on words
- Périodes locales et propagation de périodes dans un mot
- Some Algebraic Properties of Machine Poset of Infinite Words
- Streaming pattern matching with \(d\) wildcards
- A periodicity result of partial words with one hole
- Compact and tractable automaton-based representations of time granularities
- Intertwinings of periodic sequences
- Diagnostic tests under shifts with fixed filling tuple
- Prefix frequency of lost positions
- Title not available (Why is that?)
- Periodicity, morphisms, and matrices.
- Fine and Wilf words for any periods
- On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup
- The commutation of finite sets: A challenging problem
- Quasiperiodicity and string covering
- The extended equation of Lyndon and Schützenberger
- A local-global theorem on periodic maps
- Partial words and the critical factorization theorem
- On periodic properties of circular words
- On block pumpable languages
- Partial words and the critical factorization theorem revisited
- Combinatorics on partial word correlations
- On the Solution Sets of Entire Systems of Word Equations
- Solving one-variable equations in free groups
- On primary and secondary repetitions in words
- Efficient on-line repetition detection
- Recognizability for sequences of morphisms
- On the Shyr-Yu theorem
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)
- On noncounting regular classes
- Counting generic measures for a subshift of linear growth
- Pattern matching and membership for hierarchical message sequence charts
- Repetition Detection in a Dynamic String
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Periodicity and roots of transfinite strings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniformly bounded duplication codes
- Marcus contextual languages consisting of primitive words
- Periodes et repetitions des mots du monoide libre
- 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
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)
