Abstract

The zeta function of a finite automaton A is exp { ∑ n = 1 ∞ a n z n n } , where a n 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.