On the entropy and letter frequencies of powerfree words
From MaRDI portal
Publication:845374
DOI10.3390/E10040590zbMATH Open1179.68112arXiv0811.2119OpenAlexW3101113735MaRDI QIDQ845374FDOQ845374
Authors: Uwe Grimm, Manuela Heuer 
Publication date: 29 January 2010
Published in: Entropy (Search for Journal in Brave)
Abstract: We review the recent progress in the investigation of powerfree words, with particular emphasis on binary cubefree and ternary squarefree words. Besides various bounds on the entropy, we provide bounds on letter frequencies and consider their empirical distribution obtained by an enumeration of binary cubefree words up to length 80.
Full work available at URL: https://arxiv.org/abs/0811.2119
Recommendations
- On the entropy and letter frequencies of ternary square-free words
- The entropy of square-free words
- scientific article; zbMATH DE number 1361493
- Abelian complexity and frequencies of letters in infinite words
- Developments in Language Theory
- On the structure and extendibility of \(k\)-power free words
- Letter frequency in infinite repetition-free words
- On the Frequency of Letters in Morphic Sequences
- Sequence entropy and the maximal pattern complexity of infinite words
- CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
Measures of information, entropy (94A17) Symbolic dynamics (37B10) Combinatorics on words (68R15) Automata sequences (11B85)
Cites Work
- Title not available (Why is that?)
- Avoidable patterns in strings of symbols
- Title not available (Why is that?)
- Automatic Sequences
- Substitution dynamical systems - spectral analysis
- Uniformly growing k-th power-free homomorphisms
- Substitutions in dynamics, arithmetics and combinatorics
- Sharp characterizations of squarefree morphisms
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Open Problems in Pattern Avoidance
- Title not available (Why is that?)
- The Goulden—Jackson cluster method: extensions, applications and implementations
- Polynomial versus exponential growth in repetition-free binary words
- Growth of repetition-free words -- a review
- Improved bounds on the number of ternary square-free words
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- Repetition-free words
- On repetition-free binary words of minimal density
- On the entropy and letter frequencies of ternary square-free words
- Efficient lower bounds on the number of repetition-free words
- Title not available (Why is that?)
- Growth problems for avoidable words
- Title not available (Why is that?)
- Letter frequency in infinite repetition-free words
- Title not available (Why is that?)
- The entropy of square-free words
- The number of binary cube-free words of length up to 47 and their numerical analysis
- TRACE MAPS, INVARIANTS, AND SOME OF THEIR APPLICATIONS
- Title not available (Why is that?)
- How many square occurrences must a binary sequence contain?
- Title not available (Why is that?)
- A characterization of power-free morphisms
- Some results on \(k\)-power-free morphisms
- Title not available (Why is that?)
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
- The minimal density of a letter in an infinite ternary square-free word is 883/3215
- Dejean's conjecture and letter frequency
Cited In (3)
Uses Software
This page was built for publication: On the entropy and letter frequencies of powerfree words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845374)
