On a zeta function associated with automata and codes

The zeta function of a finite automaton A is , where an is the number of bi-infinite paths in A labelled by a bi-infinite word of period n. It reflects the properties of A: aperiodicity, nil-simplicity, existence of a zero. The results are applied to codes.