Pages that link to "Item:Q5654847"
From MaRDI portal
The following pages link to On a Special Class of Recurrent Events (Q5654847):
Displaying 20 items.
- Maximal bifix codes of degree 3 (Q723611) (← links)
- Completing biprefix codes (Q790624) (← links)
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index (Q1099632) (← links)
- Long unavoidable patterns (Q1101241) (← links)
- Finite biprefix sets of paths in a graph (Q1105386) (← links)
- Rational probability measures (Q1118896) (← links)
- Le degré minimal du groupe d'un code biprefixe fini (Q1132193) (← links)
- La représentation ergodique d'un automate fini (Q1133897) (← links)
- There are infinitely many complete prefix codes of constant length \(l\;(l\geq 3)\) (Q1139382) (← links)
- A graph covering construction of all the finite complete biprefix codes (Q1156495) (← links)
- Semisimplicity of the algebra associated to a biprefix code (Q1162366) (← links)
- La transitivite du groupe d'un code biprefixe fini (Q1230603) (← links)
- A note on homomorphisms of a free monoid (Q1252724) (← links)
- On the degree of finite maximal biprefix codes (Q1322583) (← links)
- On certain codes admitting inverse semigroups as syntactic monoids (Q1845834) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- Outils et résultats pour les transducteurs boustrophédons (Q4728282) (← links)
- A note on the relation between recognisable series and regular sequences, and their minimal linear representations (Q6149153) (← links)
- Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings (Q6204133) (← links)
