The following pages link to Codes asynchrones (Q4173294):
Displaying 16 items.
- Synchronization and simplification (Q755320) (← links)
- Completing biprefix codes (Q790624) (← links)
- Noncommutative factorization of variable-length codes (Q1094145) (← links)
- La représentation ergodique d'un automate fini (Q1133897) (← links)
- Unions of groups of small height (Q1172704) (← links)
- Cyclotomic polynomials and unions of groups (Q1256865) (← links)
- A partial result about the factorization conjecture for finite variable- length codes (Q1313854) (← links)
- Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes (Q1341748) (← links)
- Synchronization and decomposability for a family of codes. II (Q1893165) (← links)
- Circular automata synchronize with high probability (Q2221830) (← links)
- On a complete set of operations for factorizing codes (Q3374755) (← links)
- (Q3683550) (← links)
- Factorisation des ensembles préfixiels (Q3833638) (← links)
- Birecurrent sets (Q4576007) (← links)
- On the factorization conjecture (Q5096809) (← links)
- Cycles of relatively prime length and the road coloring problem (Q5939288) (← links)
