Efficient lower bounds on the number of repetition-free words
From MaRDI portal
Publication:3428618
zbMATH Open1118.05003MaRDI QIDQ3428618FDOQ3428618
Authors: Roman Kolpakov 
Publication date: 28 March 2007
Full work available at URL: https://eudml.org/doc/53302
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- An improved lower bound on the number of ternary squarefree words
- On an efficient method for estimating the number of nonrepeating words
- Improved bounds on the number of ternary square-free words
- Polynomial versus exponential growth in repetition-free binary words
- scientific article; zbMATH DE number 3932412
Cited In (14)
- On an efficient method for estimating the number of nonrepeating words
- Counting ternary square-free words quickly
- Avoiding or limiting regularities in words
- Binary words avoiding the pattern AABBCABBA
- An improved lower bound on the number of ternary squarefree words
- Efficient representation and counting of antipower factors in words
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
- Growth properties of power-free languages
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- Enumeration of irreducible binary words
- Improved bounds on the number of ternary square-free words
- On the entropy and letter frequencies of powerfree words
- Counting abelian squares efficiently for a problem in quantum computing
- Reduced word enumeration, complexity, and randomization
Uses Software
This page was built for publication: Efficient lower bounds on the number of repetition-free words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428618)
