Uniqueness Theorems for Periodic Functions
From MaRDI portal
Publication:5340253
DOI10.2307/2034009zbMath0131.30203OpenAlexW4243237799MaRDI QIDQ5340253
Publication date: 1965
Full work available at URL: https://doi.org/10.2307/2034009
Related Items
On a conjecture on bidimensional words., Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes, Upper bounds on distinct maximal (sub-)repetitions in compressed strings, Local periods and binary partial words: an algorithm, Primitive morphisms, A coarse-grained multicomputer algorithm for the detection of repetitions, Computing minimal and maximal suffixes of a substring, Systems of word equations, polynomials and linear algebra: a new approach, On a special class of primitive words, The new periodicity lemma revisited, Some combinatorial properties of Sturmian words, Random \(\mathbb{Z}^d\)-shifts of finite type, Alternative proof of the Lyndon-Schützenberger theorem, Saving comparisons in the Crochemore-Perrin string-matching algorithm, A periodicity result of partial words with one hole, The origins of combinatorics on words, Compact and tractable automaton-based representations of time granularities, Parikh-reducing Church-Rosser representations for some classes of regular languages, Inventories of unavoidable languages and the word-extension conjecture, The total run length of a word, Lyndon words and Fibonacci numbers, Linear computation of unbordered conjugate on unordered alphabet, Sturmian words: structure, combinatorics, and their arithmetics, On the factors of automatic words, Periods in partial words: an algorithm, Palindromes in circular words, On the maximality of languages with combined types of code properties, On periodic properties of circular words, On block pumpable languages, Periodicity, morphisms, and matrices., Random subshifts of finite type, The three squares lemma revisited, The three-squares lemma for partial words with one hole, Period recovery of strings over the Hamming and edit distances, Periods in strings, On some combinatorial problems in free monoids, Combinatorics of periods in strings., Hide and seek with repetitions, On the system of word equations \(x_{0} u^{i}_{1} x_{1} u^{i}_{2} x_{2} u^{i}_{3} x_{3}=y_{0} v^{i}_{1} y_{1} v^{i}_{2} y_{2} v^{i}_{3} y_{3}\) \((i=0,1,2,\ldots)\) in a free monoid, Graph connectivity, partial words, and a theorem of Fine and Wilf, Optimal off-line detection of repetitions in a string, Pattern matching and membership for hierarchical message sequence charts, Counting generic measures for a subshift of linear growth, On generating binary words palindromically, Periodicity on partial words, Fine and Wilf words for any periods, Periods and binary words, Partial words with a unique position starting a square, How many runs can a string contain?, On a lemma of Crochemore and Rytter, Average number of occurrences of repetitions in a necklace, Frequencies of factors of Sturmian sequences, On shortening \(u\)-cycles and \(u\)-words for permutations, Streaming pattern matching with \(d\) wildcards, Periodicity and repetitions in parameterized strings, A string-matching interpretation of the equation \(x^ m y^ n = z^ p\), Marcus contextual languages consisting of primitive words, Periodicity properties on partial words, Generalized pattern matching and periodicity under substring consistent equivalence relations, An abelian periodicity lemma, Tighter bounds for the sum of irreducible LCP values, On noncounting regular classes, Efficient on-line repetition detection, Computing regularities in strings: a survey, On the maximum number of cubic subwords in a word, On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup, An extension of the periodicity lemma to longer periods, Minimal non-convex words, Partial words and the critical factorization theorem, Generalised fine and Wilf's theorem for arbitrary number of periods, Languages under substitutions and balanced words, Characteristic Sturmian words are extremal for the critical factorization theorem, On suffix extensions in suffix trees, An extension of the Lyndon-Schützenberger result to pseudoperiodic words, Combinatorics on partial word correlations, The extended equation of Lyndon and Schützenberger, A new approach to the periodicity lemma on strings with holes, Periodes et repetitions des mots du monoide libre, Twin-roots of words and their properties, How many squares can a string contain?, Intersecting periodic words, Periodicities on trees, Commutativity in free inverse monoids, Périodes locales et propagation de périodes dans un mot, Maximal prefix products, On primary and secondary repetitions in words, Intertwinings of periodic sequences, A \(2_3^2\) superstring approximation algorithm, On the Shyr-Yu theorem, Fine and Wilf's theorem for three periods and a generalization of Sturmian words, Partial words and a theorem of Fine and Wilf, Quasiperiodicity and string covering, Time-space-optimal string matching, Repetitive perhaps, but certainly not boring, Palindrome complexity., Semiperiodic words and root-conjugacy., On Fine and Wilf's theorem for bidimensional words., Periodicity vectors for labelled trees, A combinatorial problem on trapezoidal words., The commutation of finite sets: A challenging problem, Prefix frequency of lost positions, Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester, Factorizing strings into repetitions, On the number of partitions of an integer in the \(m\)-bonacci base, Equality Testing of Compressed Strings, On systems of word equations with simple loop sets, On the distribution of characteristic parameters of words II, Words that almost commute, Approximating LZ77 via Small-Space Multiple-Pattern Matching, More results on overlapping squares, Unnamed Item, Multidimensional period recovery, An aperiodicity problem for multiwords, On primitive words with non-primitive product, Finite Completion of comma-free codes Part 2, The power word problem in graph products, On one-relator products induced by generalized triangle groups II, Shortest unique palindromic substring queries in semi-dynamic settings, On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts, String Periods in the Order-Preserving Model, Longest Common Extensions in Sublinear Space, Tighter Bounds for the Sum of Irreducible LCP Values, On topological rank of factors of Cantor minimal systems, Internal shortest absent word queries in constant time and linear space, On the number of \(k\)-powers in a finite word, Identifying codes on directed de Bruijn graphs, Boshernitzan’s condition, factor complexity, and an application, Abelian periods of factors of Sturmian words, Unnamed Item, Groups finitely presented in Burnside varieties, Unavoidable languages, cuts and innocent sets of words, Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable, The identity problem of finitely generated bi-ideals, Uniformly bounded duplication codes, An alphabetical approach to Nivat’s conjecture, Arithmetical complexity of the language of generic limit sets of cellular automata, Towards optimal packed string matching, Some Algebraic Properties of Machine Poset of Infinite Words, From Bi-ideals to Periodicity, Avoidance of split overlaps, A periodicity theorem for acylindrically hyperbolic groups, Periodicity Problem of Substitutions over Ternary Alphabets, Tight upper and lower bounds on suffix tree breadth, On a paper by Castelli, Mignosi, Restivo, Partial words and the critical factorization theorem revisited, Equations on partial words, On Critical exponents in fixed points ofk-uniform binary morphisms, Least Periods of Factors of Infinite Words, Non-primitive words of the formpqm, The generalized conjugacy problem for virtually free groups, An extension of the Burrows-Wheeler transform, The Linus Sequence, Real-Time Streaming String-Matching, A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers, Square network on a word, Modularity in the semilattice of \(\omega \)-words, Factorisation des ensembles préfixiels, Real-time recognition of substring repetition and reversal, A new combinatorial approach to sequence comparison, Expansive automata networks, Unbordered factors and Lyndon words, Maximal continuants and the Fine-Wilf theorem, Primitive partial words, Formalizing a fragment of combinatorics on words, Distance measures for biological sequences: some recent approaches, Fine and Wilf words for any periods. II, Hereditary properties of words, On a Special Class of Primitive Words, Unnamed Item, Unnamed Item, Unnamed Item, Invariant Polytopes of Sets of Matrices with Application to Regularity of Wavelets and Subdivisions, Unnamed Item, Unnamed Item, Periods in extensions of words, A palindromization map on free monoids, Embedding a \(\theta \)-invariant code into a complete one, Internal dictionary matching, String periods in the order-preserving model, Solving one-variable equations in free groups, Repetition Detection in a Dynamic String, A brief history of parameterized matching problems, The theorem of Fine and Wilf for relational periods, Lightweight merging of compressed indices based on BWT variants, Streaming \(k\)-mismatch with error correcting and applications, An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words, Bounds on the period of the continued fraction after a Möbius transformation, Quasi-Periodicity in Streams, Quasi-Linear-Time Algorithm for Longest Common Circular Factor, Diagnostic tests under shifts with fixed filling tuple, Unnamed Item, Further steps on the reconstruction of convex polyominoes from orthogonal projections, On multiperiodic words, A local-global theorem on periodic maps, A multidimensional critical factorization theorem, Binary codes that do not preserve primitivity, Periodicity and Repetitions in Parameterized Strings, A periodicity lemma for partial words, Periodicity and roots of transfinite strings, Three overlapping squares: the general case characterized \& applications, Semigroups satisfying x m+n = x n, Tight bound for the number of distinct palindromes in a tree, A simple homological characterization of string algebras of finite representation type, Extremal values of semi‐regular continuants and codings of interval exchange transformations, Finding the cyclic covers of a string, Characteristic measures for language stable subshifts, Abelian combinatorics on words: a survey, Data structures for computing unique palindromes in static and non-static strings, Near-optimal search time in \(\delta \)-optimal space, and vice versa, On the Solution Sets of Entire Systems of Word Equations, Finite and infinite closed-rich words, String Covering: A Survey, The “Runs” Theorem, Unnamed Item, Maximal closed substrings, An Inequality for the Number of Periods in a Word, Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings, Near-optimal quantum algorithms for string problems, Constructing and indexing the bijective and extended Burrows-Wheeler transform, Unnamed Item, Efficient Computation of 2-Covers of a String., Analysis of the Period Recovery Error Bound, Distinct Squares in Circular Words, Counting Palindromes in Substrings, Separating the Words of a Language by Counting Factors, Toeplitz words, generalized periodicity and periodically iterated morphisms, On one-relator products induced by generalized triangle groups I, Binary codes that do not preserve primitivity, Equations enforcing repetitions under permutations, Local and global cyclicity in free semigroups, Recurrence and periodicity in infinite words from local periods, Partial words and a theorem of Fine and Wilf revisited, Naming and ordering the modes, in light of combinatorics on words, Free products of groups are strongly verbally closed, Transition property for cube-free words, Circular pattern matching with \(k\) mismatches, On the Number of p4-Tilings by an n-Omino, Recognizability for sequences of morphisms, Elastic-Degenerate String Matching via Fast Matrix Multiplication, Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture
