The following pages link to Completing codes (Q3823514):
Displaying 19 items.
- A three-word code which is not prefix-suffix composed (Q671357) (← links)
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- Construction of a family of finite maximal codes (Q1117704) (← links)
- A note on codes having no finite completions (Q1350354) (← links)
- Hajós factorizations and completion of codes. (Q1391133) (← links)
- On maximal synchronous codes. (Q1426041) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- A first step in characterizing three-element codes (Q1656554) (← links)
- On the proportion of prefix codes in the set of three-element codes (Q2185934) (← links)
- Embedding a \(\theta \)-invariant code into a complete one (Q2285122) (← links)
- On factorizing codes: Structural properties and related decision problems (Q2370827) (← links)
- Completing circular codes in regular submonoids (Q2474228) (← links)
- An enhanced property of factorizing codes (Q2484437) (← links)
- Completing codes and the Rédei property of groups (Q2503314) (← links)
- A note on the factorization conjecture (Q2510385) (← links)
- On a complete set of operations for factorizing codes (Q3374755) (← links)
- On codes having no finite completion (Q4763927) (← links)
- On the length of uncompletable words in unambiguous automata (Q5108371) (← links)
- The second step in characterizing a three-word code (Q6090990) (← links)
