scientific article; zbMATH DE number 7559450
From MaRDI portal
Publication:5089254
DOI10.4230/LIPICS.MFCS.2020.79MaRDI QIDQ5089254FDOQ5089254
Markus A. Whiteland, Ville Salo
Publication date: 18 July 2022
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical aspects of computer and information sciences. 6th international conference, MACIS 2015, Berlin, Germany, November 11--13, 2015. Revised selected papers
- Abelian powers and repetitions in Sturmian words
- On Abelian repetition threshold
- Abelian complexity of minimal subshifts
- Abelian returns in Sturmian words
- Some unsolved problems
- Strongly non-repetitive sequences and progression-free sets
- A cyclic binary morphism avoiding abelian fourth powers
- Combinatorics, Words and Symbolic Dynamics
- On a generalization of abelian equivalence and complexity of infinite words
- Every real number greater than 1 is a critical exponent
- Geometric properties of the Markov and Lagrange spectra
- ON ABELIAN POWER-FREE MORPHISMS
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Markov's Theorem and 100 Years of the Uniqueness Conjecture
- Words strongly avoiding fractional powers
- Combinatorics on words. 12th international conference, WORDS 2019, Loughborough, UK, September 9--13, 2019. Proceedings
- Automata, languages and programming. 19th international colloquium, Wien, Austria, July 13--17, 1992. Proceedings
- Abelian periods of factors of Sturmian words
- Sequences, groups, and number theory
- From Christoffel Words to Markoff Numbers
- Developments in language theory. 22nd international conference, DLT 2018, Tokyo, Japan, September 10--14, 2018. Proceedings
- On $k$-abelian equivalence and generalized Lagrange spectra
Cited In (3)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Growth rate of binary words avoiding \(xxx^{R}\) 👍 👎
- On a generalization of abelian equivalence and complexity of infinite words 👍 👎
- Polynomial versus exponential growth in repetition-free binary words 👍 👎
- Abelian closures of infinite binary words 👍 👎
- Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words 👍 👎
- Another generalization of abelian equivalence: binomial complexity of infinite words 👍 👎
- The number of binary words avoiding Abelian fourth powers grows exponentially 👍 👎
- Abelian antipowers in infinite words 👍 👎
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)
