The following pages link to (Q3700856):
Displaying 14 items.
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- Pseudo-cyclic renewal systems (Q719279) (← links)
- Codes and maximal monoids (Q964399) (← links)
- Construction of a family of finite maximal codes (Q1117704) (← links)
- Languages whose \(n\)-element subsets are codes (Q1184989) (← links)
- A note on codes having no finite completions (Q1350354) (← links)
- Hajós factorizations and completion of codes. (Q1391133) (← links)
- On maximal codes with a finite interpreting delay. (Q1605334) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- Embedding a \(\theta \)-invariant code into a complete one (Q2285122) (← links)
- On a complete set of operations for factorizing codes (Q3374755) (← links)
- Completing codes (Q3823514) (← links)
- On codes having no finite completion (Q4341033) (← links)
- On codes having no finite completion (Q4763927) (← links)
