Sur un algorithme donnant les codes bipréfixes finis
From MaRDI portal
Publication:5652538
Cites work
Cited in
(15)- Embedding a \(\theta \)-invariant code into a complete one
- On a complete set of operations for factorizing codes
- La transitivite du groupe d'un code biprefixe fini
- La représentation ergodique d'un automate fini
- Le degré minimal du groupe d'un code biprefixe fini
- Finite maximal solid codes
- scientific article; zbMATH DE number 3905865 (Why is no real title available?)
- Bifix codes and Sturmian words
- On the factorization conjecture
- Sur le produit de concatenation non ambigu
- A property of biprefix codes
- Finite biprefix sets of paths in a graph
- A graph covering construction of all the finite complete biprefix codes
- Codes asynchrones
- A partial result about the factorization conjecture for finite variable- length codes
This page was built for publication: Sur un algorithme donnant les codes bipréfixes finis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652538)