A cyclic binary morphism avoiding abelian fourth powers
From MaRDI portal
Publication:1001897
DOI10.1016/J.TCS.2008.09.027zbMATH Open1161.68044OpenAlexW2029064195MaRDI QIDQ1001897FDOQ1001897
Authors: James D. Currie, Ali Aberkane 
Publication date: 19 February 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.027
Cites Work
- BLOCKING SETS OF TERMS
- Title not available (Why is that?)
- Automatic Sequences
- Title not available (Why is that?)
- Strongly non-repetitive sequences and progression-free sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern avoidance: themes and variations
- Title not available (Why is that?)
- Growth problems for avoidable words
- Avoiding patterns in the abelian sense
- The number of binary words avoiding Abelian fourth powers grows exponentially
Cited In (7)
- Abelian repetitions in partial words
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- Fixed points avoiding abelian \(k\)-powers
- Title not available (Why is that?)
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Identifying all abelian periods of a string in quadratic time and relevant problems
- A powerful abelian square-free substitution over 4 letters
This page was built for publication: A cyclic binary morphism avoiding abelian fourth powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001897)
