Weighted prefix normal words: mind the gap
The authors discuss possible generalizations to larger alphabets of the notion of prefix normal words defined by \textit{G. Fici} and \textit{Z. Lipták} [Lect. Notes Comput. Sci. 6795, 228--238 (2011; Zbl 1221.68128)] as words whose prefixes contain at least as many 1s as any of their factors of the same length. The suggestion is to assign to each letter of the alphabet its weight and to consider, instead of the number of ones, the weight function defined either as the sum or the product of weights of letters. The situations can be predictably different and rather complicated depending on the details of the definition of the weight function. As is announced in the paper, the properties of the weight function are nicer when it is \textit{gapfree}. For the entire collection see [Zbl 1482.68035].
- On prefix normal words
- On prefix normal words and prefix normal forms
- On collapsing prefix normal words
- On infinite prefix normal words
- On infinite prefix normal words
- The weighted words collector
- scientific article; zbMATH DE number 5291306
- The method of weighted words revisited
- About prefix sets of words
- On combinatorial generation of prefix normal words
- A connection between palindromic and factor complexity using return words
- Abelian complexity of minimal subshifts
- Algorithms for jumbled pattern matching in strings
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Bubble-flip -- a new generation algorithm for prefix normal words
- Clustered Integer 3SUM via Additive Combinatorics
- Computing abelian complexity of binary uniform morphic words
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Cyclic complexity of words
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Factor versus palindromic complexity of uniformly recurrent infinite words
- Generalized Pascal triangle for binomial coefficients of words
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- On a class of infinite words with affine factor complexity
- On collapsing prefix normal words
- On combinatorial generation of prefix normal words
- On growth and fluctuation of \(k\)-abelian complexity
- On hardness of jumbled indexing
- On infinite prefix normal words
- On prefix normal words
- On prefix normal words and prefix normal forms
- Subword complexity and power avoidance
- The asymptotic number of prefix normal words
- The On-Line Encyclopedia of Integer Sequences
This page was built for publication: Weighted prefix normal words: mind the gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832931)