Zeta Functions of Recognizable Languages

@inproceedings{Berstel1988ZetaFO,
  title={Zeta Functions of Recognizable Languages},
  author={Jean Berstel and Christophe Reutenauer},
  booktitle={ICALP},
  year={1988}
}
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 automaton is rational. 
3 Citations

References

SHOWING 1-10 OF 27 REFERENCES
Algebraic Geometry
Introduction to Algebraic Geometry.By Serge Lang. Pp. xi + 260. (Addison–Wesley: Reading, Massachusetts, 1972.)
On the Rationality of the Zeta Function of an Algebraic Variety
Let p be a prime number, a2 the completion of the algebraic closure of the field of rational p-adic numbers and let A be the residue class field of Q. The field A is the algebraic closure of its
p-adic Numbers, p-adic Analysis, and Zeta-Functions
P-adic numbers p-adic interpolation of the reimann zeta-function p-adic power series rationality of the zeta-function of a set of equations over a finite field (Part contents).
Automata, languages, and machines. A
  • S. Eilenberg
  • Computer Science
    Pure and applied mathematics
  • 1974
Sofic systems
A symbolic flow is called a sofic system if it is a homomorphic image (factor) of a subshift of finite type. We show that every sofic system can be realized as a finite-to-one factor of a subshift of
Semisimplicity of the algebra associated to a biprefix code
{. INTRODUCTION There exists a canonical way to associate to each language (that is, to each subset of a free monoid) an algebra on a ~iven field; we call it its syntactic algebra. This construction
Rational series and their languages
TLDR
This chapter discusses the development of Rational Series over a Principal Ring, a model based on the model developed in Chapter I, and its applications to Languages and Codes.
Ensembles libres de chemins dans un graphe
On etablit les bases d'une extension de la theorie des codes a longueur variable aux chemins dans les graphes orientes. On caracterise les graphes fortement connexes par l'irreductibilite de leur
...
...