Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436822 | Theoretical Computer Science | 2007 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics