Zeta functions of formal languages
Jean Berstel, Christophe Reutenauer · Transactions of the American Mathematical Society · 1990
Motivated by symbolic dynamics and algebraic geometry over finite fields, we define cyclic languages and the zeta function of a language. The main result is that the zeta function of a cyclic language which is recognizable by a finite automation is rational.