Weighted prefix normal words: mind the gap
From MaRDI portal
Abstract: A prefix normal word is a binary word whose prefixes contain at least as many 1s as any of its factors of the same length. Introduced by Fici and Lipt'ak in 2011 the notion of prefix normality is so far only defined for words over the binary alphabet. In this work we investigate a generalisation for finite words over arbitrary finite alphabets, namely weighted prefix normality. We prove that weighted prefix normality is more expressive than binary prefix normality. Furthermore, we investigate the existence of a weighted prefix normal form since weighted prefix normality comes with several new peculiarities that did not already occur in the binary case. We characterise these issues and finally present a standard technique to obtain a generalised prefix normal form for all words overarbitrary, finite alphabets.
Recommendations
- 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
Cites work
- 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 On-Line Encyclopedia of Integer Sequences
- The asymptotic number of prefix normal words
Cited in
(4)
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)
