Uniqueness Theorems for Periodic Functions
From MaRDI portal
Publication:5340253
Cited in
(only showing first 100 items - show all)- 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\)
- On noncounting regular classes
- Minimal non-convex words
- Partial words and the critical factorization theorem
- On the number of partitions of an integer in the \(m\)-bonacci base
- Quasiperiodicity and string covering
- Périodes locales et propagation de périodes dans un mot
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- Streaming pattern matching with \(d\) wildcards
- Sequentiality of string-to-context transducers
- A local-global theorem on periodic maps
- Distinct squares in circular words
- Recognizability for sequences of morphisms
- On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup
- Recurrence and periodicity in infinite words from local periods
- Counting generic measures for a subshift of linear growth
- On periodic properties of circular words
- On block pumpable languages
- Compact and tractable automaton-based representations of time granularities
- The commutation of finite sets: A challenging problem
- On suffix extensions in suffix trees
- Periodicity, morphisms, and matrices.
- On the Solution Sets of Entire Systems of Word Equations
- Hereditary properties of words
- scientific article; zbMATH DE number 7559186 (Why is no real title available?)
- Finite Completion of comma-free codes Part 2
- Solving one-variable equations in free groups
- Efficient on-line repetition detection
- Periodes et repetitions des mots du monoide libre
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Unbordered factors and Lyndon words
- Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
- Partial words and the critical factorization theorem revisited
- Intertwinings of periodic sequences
- Fine and Wilf words for any periods
- On some combinatorial problems in free monoids
- Twin-roots of words and their properties
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Periodicities on trees
- A periodicity result of partial words with one hole
- Diagnostic tests under shifts with fixed filling tuple
- Formalizing a fragment of combinatorics on words
- Uniformly bounded duplication codes
- Pattern matching and membership for hierarchical message sequence charts
- 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
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)