On a Special Class of Recurrent Events

DOI10.1214/AOMS/1177704860zbMATH Open0243.60049OpenAlexW2124314201MaRDI QIDQ5654847FDOQ5654847

Marcel Paul Schützenberger

Publication date: 1961

Published in: 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

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

Cited In (24)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654847)