Zeta Functions of Formal Languages

DOI10.2307/2001573zbMath0797.68092OpenAlexW4248520500MaRDI QIDQ4711989

Christophe Reutenauer, Jean Berstel

Publication date: 25 June 1992

Full work available at URL: https://doi.org/10.2307/2001573

zbMATH Keywords

zeta functionsymbolic dynamicsformal languagesformal power seriessofic systemalgebraic geometry over finite fieldscyclic languagecharacteristic seriescyclic recognizable languageminimal ideals in finite semigroupsrationality of zeta functiontraces of finite deterministic automata

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture) (14G10) Semigroups in automata theory, linguistics, etc. (20M35) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25)

Related Items (13)

Generalized Dyck shifts ⋮ Automata and one-dimensional TQFTs with defects ⋮ Sofic-Dyck shifts ⋮ One-dimensional topological theories with defects: the linear case ⋮ Decorated one-dimensional cobordisms and tensor envelopes of noncommutative recognizable power series ⋮ \(\mathbb{N}\)-rationality of zeta functions ⋮ A hierarchy of cyclic languages ⋮ Combinatorial addition formulas and applications ⋮ On a zeta function associated with automata and codes ⋮ Shifts of \(k\)-nested sequences ⋮ Character theory of monoids over an arbitrary field. ⋮ Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique ⋮ Studies on finite Sturmian words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A necessary condition for the rationality of the zeta function of a regular language
• Series formelles et algèbres syntactiques
• Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
• Semisimplicity of the algebra associated to a biprefix code
• On generalized zeta functions of formal languages and series
• Sofic systems
• Minimal automaton for a factorial, transitive, and rational language
• Subshifts of finite type and sofic systems
• Finitely presented dynamical systems
• Ensembles libres de chemins dans un graphe
• Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique
• Sur certains sous-monoïdes libres
• On the Rationality of the Zeta Function of an Algebraic Variety
• Axiom A Diffeomorphisms have Rational Zeta Functions

This page was built for publication: Zeta Functions of Formal Languages