Cited in
(only showing first 100 items - show all)- Twin-roots of words and their properties
- Intersecting periodic words
- On the Shyr-Yu theorem
- Inventories of unavoidable languages and the word-extension conjecture
- Periods in strings
- On some combinatorial problems in free monoids
- Optimal off-line detection of repetitions in a string
- A string-matching interpretation of the equation x^ m y^ n = z^ p
- On noncounting regular classes
- Periodes et repetitions des mots du monoide libre
- How many squares can a string contain?
- Periodicities on trees
- Commutativity in free inverse monoids
- Périodes locales et propagation de périodes dans un mot
- Intertwinings of periodic sequences
- A 2_3² superstring approximation algorithm
- 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
- Some combinatorial properties of Sturmian words
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Sturmian words: structure, combinatorics, and their arithmetics
- On the factors of automatic words
- Periodicity, morphisms, and matrices.
- Combinatorics of periods in strings.
- Periodicity on partial words
- Fine and Wilf words for any periods
- Repetitive perhaps, but certainly not boring
- A combinatorial problem on trapezoidal words.
- The commutation of finite sets: A challenging problem
- Improved upper bounds on all maximal -gapped repeats and palindromes
- Systems of word equations, polynomials and linear algebra: a new approach
- Parikh-reducing Church-Rosser representations for some classes of regular languages
- Period recovery of strings over the Hamming and edit distances
- Hide and seek with repetitions
- Counting generic measures for a subshift of linear growth
- Partial words with a unique position starting a square
- On shortening u-cycles and u-words for permutations
- Streaming pattern matching with \(d\) wildcards
- 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
- Partial words and the critical factorization theorem
- Maximal prefix products
- Time-space-optimal string matching
- Palindrome complexity.
- Semiperiodic words and root-conjugacy.
- On Fine and Wilf's theorem for bidimensional words.
- Periodicity vectors for labelled trees
- On a conjecture on bidimensional words.
- Local periods and binary partial words: an algorithm
- Periods in partial words: an algorithm
- 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
- Periods and binary words
- Expansive automata networks
- Formalizing a fragment of combinatorics on words
- Internal dictionary matching
- Diagnostic tests under shifts with fixed filling tuple
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Binary codes that do not preserve primitivity
- A periodicity lemma for partial words
- Factorizing strings into repetitions
- Words that almost commute
- Multidimensional period recovery
- The power word problem in graph products
- Shortest unique palindromic substring queries in semi-dynamic settings
- Abelian periods of factors of Sturmian words
- Groups finitely presented in Burnside varieties
- Avoidance of split overlaps
- A periodicity theorem for acylindrically hyperbolic groups
- Tight upper and lower bounds on suffix tree breadth
- Square network on a word
- Modularity in the semilattice of \(\omega \)-words
- Distance measures for biological sequences: some recent approaches
- Fine and Wilf words for any periods. II
- Embedding a -invariant code into a complete one
- String periods in the order-preserving model
- A brief history of parameterized matching problems
- Lightweight merging of compressed indices based on BWT variants
- Streaming \(k\)-mismatch with error correcting and applications
- Bounds on the period of the continued fraction after a Möbius transformation
- Three overlapping squares: the general case characterized \& applications
- Prefix frequency of lost positions
- On the number of partitions of an integer in the m-bonacci base
- On systems of word equations with simple loop sets
- More results on overlapping squares
- Identifying codes on directed de Bruijn graphs
- The identity problem of finitely generated bi-ideals
- Towards optimal packed string matching
- Partial words and the critical factorization theorem revisited
- An extension of the Burrows-Wheeler transform
- A new combinatorial approach to sequence comparison
- Unbordered factors and Lyndon words
- Maximal continuants and the Fine-Wilf theorem
- Primitive partial words
- Periods in extensions of words
- A palindromization map on free monoids
- A local-global theorem on periodic maps
- A multidimensional critical factorization theorem
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)
