On a Special Class of Recurrent Events
From MaRDI portal
Cited in
(25)- 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
- Le degré minimal du groupe d'un code biprefixe fini
- La représentation ergodique d'un automate fini
- There are infinitely many complete prefix codes of constant length l\;(l 3)
- A graph covering construction of all the finite complete biprefix codes
- Semisimplicity of the algebra associated to a biprefix code
- La transitivite du groupe d'un code biprefixe fini
- A note on homomorphisms of a free monoid
- On the degree of finite maximal biprefix codes
- On certain codes admitting inverse semigroups as syntactic monoids
- Bifix codes and Sturmian words
- Learning weighted automata
- scientific article; zbMATH DE number 3905865 (Why is no real title available?)
- Codes asynchrones
- Birecurrent sets
- Outils et résultats pour les transducteurs boustrophédons
- 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
- Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings
- Maximal bifix codes of degree 3
- Bernoulli sets over ternary and multiletter alphabets: algebraic characterizations, polynomial divisibility, and commutative prefix properties
- 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)
