Zeta functions of formal languages-Reference-Cited by-同舟云学术

Zeta functions of formal languages

Published:1990 Issue:2 Volume:321 Page:533-546
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Berstel Jean,Reutenauer Christophe

Abstract

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1990-321-02/S0002-9947-1990-0998123-X/S0002-9947-1990-0998123-X.pdf

Reference29 articles.

1. M.-P. Béal, Puissance extérieure d’un automate déterministe: application au calcul de la fonction zeta d’un système sofique (to appear).

2. Minimal automaton for a factorial, transitive, and rational language;Beauquier, Danièle;Theoret. Comput. Sci.,1989

3. Pure and Applied Mathematics;Berstel, Jean,1985

4. EATCS Monographs on Theoretical Computer Science;Berstel, Jean,1988

5. Zeta functions of restrictions of the shift transformation;Bowen, R.,1970

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shifts of k-nested sequences;Theoretical Computer Science;2017-01

2. Generalized Dyck Shifts;Computer Science – Theory and Applications;2017

3. 12 Zeta Functions of Languages and Dynamical Systems;Representation Theory of Finite Monoids;2016

4. Sofic-Dyck shifts;Theoretical Computer Science;2016-01

5. Studies on finite Sturmian words;Theoretical Computer Science;2015-08