On a Special Class of Recurrent Events

DOI10.1214/aoms/1177704860zbMath0243.60049OpenAlexW2124314201MaRDI QIDQ5654847

Schützenberger, Marcel-Paul

Publication date: 1961

Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoms/1177704860

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov processes (60J99)

Related Items (24)

The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ Long unavoidable patterns ⋮ Finite biprefix sets of paths in a graph ⋮ Rational probability measures ⋮ Birecurrent sets ⋮ Le degré minimal du groupe d'un code biprefixe fini ⋮ Learning Weighted Automata ⋮ La représentation ergodique d'un automate fini ⋮ There are infinitely many complete prefix codes of constant length \(l\;(l\geq 3)\) ⋮ Sur un algorithme donnant les codes bipréfixes finis ⋮ A note on the relation between recognisable series and regular sequences, and their minimal linear representations ⋮ Bifix codes and Sturmian words ⋮ Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings ⋮ A graph covering construction of all the finite complete biprefix codes ⋮ Semisimplicity of the algebra associated to a biprefix code ⋮ Unnamed Item ⋮ La transitivite du groupe d'un code biprefixe fini ⋮ Maximal bifix codes of degree 3 ⋮ A note on homomorphisms of a free monoid ⋮ Codes asynchrones ⋮ Outils et résultats pour les transducteurs boustrophédons ⋮ On certain codes admitting inverse semigroups as syntactic monoids ⋮ Completing biprefix codes ⋮ On the degree of finite maximal biprefix codes

This page was built for publication: On a Special Class of Recurrent Events