Weighted prefix normal words: mind the gap
From MaRDI portal
Publication:832931
DOI10.1007/978-3-030-81508-0_12zbMath1491.68146arXiv2005.09281OpenAlexW3196420219MaRDI QIDQ832931
Dirk Nowotka, Yannik Eikmeier, Pamela Fleischmann, Mitja Kulczynski
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2005.09281
Uses Software
Cites Work
- Generalized Pascal triangle for binomial coefficients of words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Cyclic complexity of words
- On prefix normal words and prefix normal forms
- On collapsing prefix normal words
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- The On-Line Encyclopedia of Integer Sequences
- The asymptotic number of prefix normal words
- Subword complexity and power avoidance
- Factor versus palindromic complexity of uniformly recurrent infinite words
- A connection between palindromic and factor complexity using return words
- On a class of infinite words with affine factor complexity
- Computing abelian complexity of binary uniform morphic words
- Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
- Clustered Integer 3SUM via Additive Combinatorics
- Abelian complexity of minimal subshifts
- On Growth and Fluctuation of k-Abelian Complexity
- On Combinatorial Generation of Prefix Normal Words
- On Hardness of Jumbled Indexing
- On Prefix Normal Words
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- On infinite prefix normal words
- Bubble-flip -- a new generation algorithm for prefix normal words
This page was built for publication: Weighted prefix normal words: mind the gap
