Codes asynchrones
From MaRDI portal
Cites work
- Codes with bounded synchronization delay
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3461821 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3529706 (Why is no real title available?)
- scientific article; zbMATH DE number 3583696 (Why is no real title available?)
- scientific article; zbMATH DE number 3332047 (Why is no real title available?)
- scientific article; zbMATH DE number 3367062 (Why is no real title available?)
- La transitivite du groupe d'un code biprefixe fini
- On a Special Class of Recurrent Events
- On the factorisation of finite abelian groups
- Sur certains sous-monoïdes libres
- Sur un algorithme donnant les codes bipréfixes finis
- THE FACTORIZATION OF ABELIAN GROUPS
Cited in
(16)- Noncommutative factorization of variable-length codes
- La représentation ergodique d'un automate fini
- Unions of groups of small height
- Cyclotomic polynomials and unions of groups
- A partial result about the factorization conjecture for finite variable- length codes
- Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
- Synchronization and decomposability for a family of codes. II
- Circular automata synchronize with high probability
- On a complete set of operations for factorizing codes
- scientific article; zbMATH DE number 3905865 (Why is no real title available?)
- Factorisation des ensembles préfixiels
- Birecurrent sets
- On the factorization conjecture
- Cycles of relatively prime length and the road coloring problem
- Synchronization and simplification
- Completing biprefix codes
This page was built for publication: Codes asynchrones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173294)
