Searching for Zimin patterns
From MaRDI portal
Publication:2512657
Abstract: In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word is introduced here as the maximum rank of a Zimin pattern matching . We show how to compute Zimin type of a word on-line in linear time. Consequently we get a quadratic time, linear-space algorithm for searching Zimin patterns in words. Then we how the Zimin type of the length prefix of the infinite Fibonacci word is related to the representation of in the Fibonacci numeration system. Using this relation, we prove that Zimin types of such prefixes and Zimin patterns inside them can be found in logarithmic time. Finally, we give some bounds on the function such that every -ary word of length at least has a factor that matches the rank Zimin pattern.
Recommendations
Cites work
- Avoidable patterns in strings of symbols
- BLOCKING SETS OF TERMS
- Bounds on Zimin word avoidance
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Least Periods of Factors of Infinite Words
- Pattern avoidance: themes and variations
- Repetitions in the Fibonacci infinite word
Cited in
(3)
This page was built for publication: Searching for Zimin patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512657)