scientific article; zbMATH DE number 7559450
From MaRDI portal
Publication:5089254
Recommendations
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Growth rate of binary words avoiding \(xxx^{R}\)
- Ultimately constant abelian complexity of infinite words
- Abelian antipowers in infinite words
- Polynomial versus exponential growth in repetition-free binary words
- Abelian closures of infinite binary words
- On a generalization of abelian equivalence and complexity of infinite words
- scientific article; zbMATH DE number 2186883
Cites work
- A cyclic binary morphism avoiding abelian fourth powers
- Abelian complexity of minimal subshifts
- Abelian periods of factors of Sturmian words
- Abelian powers and repetitions in Sturmian words
- Abelian returns in Sturmian words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Automata, languages and programming. 19th international colloquium, Wien, Austria, July 13--17, 1992. Proceedings
- Combinatorics on words. 12th international conference, WORDS 2019, Loughborough, UK, September 9--13, 2019. Proceedings
- Combinatorics, Words and Symbolic Dynamics
- Developments in language theory. 22nd international conference, DLT 2018, Tokyo, Japan, September 10--14, 2018. Proceedings
- Every real number greater than 1 is a critical exponent
- From Christoffel Words to Markoff Numbers
- Geometric properties of the Markov and Lagrange spectra
- scientific article; zbMATH DE number 43747 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 6272378 (Why is no real title available?)
- Markov's theorem and 100 years of the uniqueness conjecture. A mathematical journey from irrational numbers to perfect matchings
- Mathematical aspects of computer and information sciences. 6th international conference, MACIS 2015, Berlin, Germany, November 11--13, 2015. Revised selected papers
- On \(k\)-abelian equivalence and generalized Lagrange spectra
- On a generalization of abelian equivalence and complexity of infinite words
- ON ABELIAN POWER-FREE MORPHISMS
- On Abelian repetition threshold
- Sequences, groups, and number theory
- Some unsolved problems
- Strongly non-repetitive sequences and progression-free sets
- Words strongly avoiding fractional powers
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089254)
