On the entropy and letter frequencies of powerfree words
From MaRDI portal
(Redirected from Publication:845374)
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.
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
Cites work
- scientific article; zbMATH DE number 1001617 (Why is no real title available?)
- scientific article; zbMATH DE number 3911730 (Why is no real title available?)
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 1264511 (Why is no real title available?)
- scientific article; zbMATH DE number 2000848 (Why is no real title available?)
- scientific article; zbMATH DE number 3006524 (Why is no real title available?)
- scientific article; zbMATH DE number 1919522 (Why is no real title available?)
- scientific article; zbMATH DE number 3995996 (Why is no real title available?)
- scientific article; zbMATH DE number 3894492 (Why is no real title available?)
- A characterization of power-free morphisms
- Automatic Sequences
- Avoidable patterns in strings of symbols
- Dejean's conjecture and letter frequency
- Efficient lower bounds on the number of repetition-free words
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
- Growth of repetition-free words -- a review
- Growth problems for avoidable words
- How many square occurrences must a binary sequence contain?
- Improved bounds on the number of ternary square-free words
- Letter frequency in infinite repetition-free words
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- On repetition-free binary words of minimal density
- On the entropy and letter frequencies of ternary square-free words
- Open Problems in Pattern Avoidance
- Polynomial versus exponential growth in repetition-free binary words
- Repetition-free words
- Sharp characterizations of squarefree morphisms
- Some results on \(k\)-power-free morphisms
- Substitution dynamical systems - spectral analysis
- Substitutions in dynamics, arithmetics and combinatorics
- TRACE MAPS, INVARIANTS, AND SOME OF THEIR APPLICATIONS
- The Goulden—Jackson cluster method: extensions, applications and implementations
- The entropy of square-free words
- The minimal density of a letter in an infinite ternary square-free word is 883/3215
- The number of binary cube-free words of length up to 47 and their numerical analysis
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Uniformly growing k-th power-free homomorphisms
Cited in
(3)
Describes a project that uses
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)
