Weighted prefix normal words
From MaRDI portal
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
- 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
- Faster min-plus product for monotone instances
- Generalized Pascal triangle for binomial coefficients of words
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- Inverse Lyndon words and inverse Lyndon factorizations of words
- On a class of infinite words with affine factor complexity
- On Burnside's Problem
- 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
- Weighted prefix normal words: mind the gap
This page was built for publication: Weighted prefix normal words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885376)
