Abstract
In this chapter, we apply the character theory of finite monoids to provide a proof of a theorem of Berstel and Reutenauer on the rationality of zeta functions of cyclic regular languages [BR90]. This generalizes the rationality of zeta functions of sofic shifts [Man71, LM95], an important result in symbolic dynamics. Background on free monoids, formal languages, and automata can be found in [Eil74, Eil76, Lot97, Lot02, BPR10, BR11].
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
