Codes asynchrones
From MaRDI portal
Publication:4173294
DOI10.24033/bsmf.1857zbMath0391.94017OpenAlexW4234145279MaRDI QIDQ4173294
Publication date: 1977
Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=BSMF_1977__105__385_0
Free MonoidPrefixAsynchronous CodesFactorization Theorem of M.P.SchuetzenbergerMaximal Biprefixed CodesSuffix
Related Items
Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes ⋮ Noncommutative factorization of variable-length codes ⋮ Synchronization and decomposability for a family of codes. II ⋮ Birecurrent sets ⋮ La représentation ergodique d'un automate fini ⋮ On the factorization conjecture ⋮ Circular automata synchronize with high probability ⋮ Unions of groups of small height ⋮ Unnamed Item ⋮ Factorisation des ensembles préfixiels ⋮ Cycles of relatively prime length and the road coloring problem ⋮ On a complete set of operations for factorizing codes ⋮ Cyclotomic polynomials and unions of groups ⋮ Synchronization and simplification ⋮ Completing biprefix codes ⋮ A partial result about the factorization conjecture for finite variable- length codes
Cites Work
- La transitivite du groupe d'un code biprefixe fini
- On the factorisation of finite abelian groups
- THE FACTORIZATION OF ABELIAN GROUPS
- Sur certains sous-monoïdes libres
- Codes with bounded synchronization delay
- Sur un algorithme donnant les codes bipréfixes finis
- On a Special Class of Recurrent Events
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
