We prove that if a is an algebraic power series of degree , height , and genus , then the sequence a is generated by an automaton with at most states, up to a vanishingly small error term. This is a significant improvement on previously known bounds. Our approach follows an idea of David Speyer to connect automata theory with algebraic geometry by representing the transitions in an automaton as twisted Cartier operators on the differentials of a curve.
"Automatic sequences and curves over finite fields." Algebra Number Theory 11 (3) 685 - 712, 2017. https://doi.org/10.2140/ant.2017.11.685