Uniqueness Theorems for Periodic Functions

Cited in

(only showing first 100 items - show all)

The total run length of a word
Lyndon words and Fibonacci numbers
Counting palindromes in substrings
Periods in strings
Abelian combinatorics on words: a survey
Semiperiodic words and root-conjugacy.
Near-optimal search time in \(\delta \)-optimal space, and vice versa
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
On the maximality of languages with combined types of code properties
Palindromes in circular words
Periodicity and Repetitions in Parameterized Strings
scientific article; zbMATH DE number 7651171 (Why is no real title available?)
A multidimensional critical factorization theorem
Combinatorics of periods in strings.
Binary codes that do not preserve primitivity
Avoidance of split overlaps
Upper bounds on distinct maximal (sub-)repetitions in compressed strings
A coarse-grained multicomputer algorithm for the detection of repetitions
Abelian periods of factors of Sturmian words
Periodicity vectors for labelled trees
Local and global cyclicity in free semigroups
scientific article; zbMATH DE number 3693557 (Why is no real title available?)
scientific article; zbMATH DE number 7559452 (Why is no real title available?)
Frequencies of factors of Sturmian sequences
Finite and infinite closed-rich words
A periodicity theorem for acylindrically hyperbolic groups
Separating the words of a language by counting factors
Equality Testing of Compressed Strings
Partial words with a unique position starting a square
Bounds on the period of the continued fraction after a Möbius transformation
Alternative proof of the Lyndon-Schützenberger theorem
Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
Binary codes that do not preserve primitivity
On the distribution of characteristic parameters of words II
Tight upper and lower bounds on suffix tree breadth
How many runs can a string contain?
Groups finitely presented in Burnside varieties
Minimal non-convex words
String Covering: A Survey
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
Boshernitzan’s condition, factor complexity, and an application
Partial words and a theorem of Fine and Wilf
Square network on a word
On shortening u-cycles and u-words for permutations
Efficient Computation of 2-Covers of a String.
The three-squares lemma for partial words with one hole
Expansive automata networks
Periods and binary words
An aperiodicity problem for multiwords
On topological rank of factors of Cantor minimal systems
On primitive words with non-primitive product
String Periods in the Order-Preserving Model
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Finite Completion of comma-free codes Part 2
The generalized conjugacy problem for virtually free groups.
Saving comparisons in the Crochemore-Perrin string-matching algorithm
Twin-roots of words and their properties
Lightweight merging of compressed indices based on BWT variants
Recurrence and periodicity in infinite words from local periods
Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
On suffix extensions in suffix trees
An extension of the Lyndon-Schützenberger result to pseudoperiodic words
On the number of partitions of an integer in the \(m\)-bonacci base
Streaming \(k\)-mismatch with error correcting and applications
Generalised fine and Wilf's theorem for arbitrary number of periods
Languages under substitutions and balanced words
Periodicities on trees
Commutativity in free inverse monoids
A 2_3² superstring approximation algorithm
Improved upper bounds on all maximal -gapped repeats and palindromes
Systems of word equations, polynomials and linear algebra: a new approach
Graph connectivity, partial words, and a theorem of Fine and Wilf
On some combinatorial problems in free monoids
Partial words and a theorem of Fine and Wilf revisited
Primitive morphisms
Unbordered factors and Lyndon words
Further steps on the reconstruction of convex polyominoes from orthogonal projections
Computing regularities in strings: a survey
Hereditary properties of words
Maximal prefix products
Sturmian words: structure, combinatorics, and their arithmetics
Real-time streaming string-matching
Computing minimal and maximal suffixes of a substring
Linear computation of unbordered conjugate on unordered alphabet
Non-primitive words of the formpq^m
Unavoidable languages, cuts and innocent sets of words
Maximal closed substrings
Finding the cyclic covers of a string
Analysis of the Period Recovery Error Bound
Formalizing a fragment of combinatorics on words
Distinct squares in circular words
On a special class of primitive words
Périodes locales et propagation de périodes dans un mot
Factorizing strings into repetitions
Even faster elastic-degenerate string matching via fast matrix multiplication
On one-relator products induced by generalized triangle groups. I
On a conjecture on bidimensional words.
Streaming pattern matching with \(d\) wildcards
Some Algebraic Properties of Machine Poset of Infinite Words
An Inequality for the Number of Periods in a Word

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)