2-balanced sequences coding rectangle exchange transformation

HIGHLIGHTS

• What: The authors show that the class contains of any given letter frequencies. The authors provide an upper bound on factor and of these Using the interpretation by transformation the authors prove that for almost all triples of letter frequencies the upper bound on factor and is reached. For reader`s convenience, the authors provide here a simple proof based on 2 interval exchange transformation. The authors compare the factor and abelian complexity with the upper bounds from Theorem 9 for v=colour(u, a, b), where u is a Sturmian sequence over {a, b} and α is . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.