Automatic sequences: from rational bases to trees

HIGHLIGHTS

• who: Michel Rigo and colleagues from the ArxivDepartment of Mathematics, University of Lieu0300ge, Belgium have published the research: Automatic sequences: from rational bases to trees, in the Preprint: Arxiv of 21/06/2022
• what: The authors provide examples of such sequences that are not morphic. The authors show that any automatic sequence built on a * Roughly, with the next two theorems, the authors characterize pq -automatic sequences in terms of the extensions that factors of a fixed height occurring infinitely often may have. The authors show that its output function meets the condition in Theorem . . .
  

   

  

  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.