Automatic sequences and curves over finite fields

From MaRDI portal
Publication:2397618




Abstract: We prove that if is an algebraic power series of degree d, height h, and genus g, then the sequence is generated by an automaton with at most qh+d+g1 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.











This page was built for publication: Automatic sequences and curves over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397618)