Pages that link to "Item:Q1117704"
From MaRDI portal
The following pages link to Construction of a family of finite maximal codes (Q1117704):
Displaying 17 items.
- Finite maximal codes and triangle conjecture (Q729792) (← links)
- A partial result about the factorization conjecture for finite variable- length codes (Q1313854) (← links)
- Hajós factorizations and completion of codes. (Q1391133) (← links)
- On some Schützenberger conjectures (Q1854441) (← links)
- A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571) (← links)
- Synchronization and decomposability for a family of codes. II (Q1893165) (← links)
- Embedding a \(\theta \)-invariant code into a complete one (Q2285122) (← links)
- On factorizing codes: Structural properties and related decision problems (Q2370827) (← links)
- An enhanced property of factorizing codes (Q2484437) (← 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 (Q4341033) (← links)
- ON A PROPERTY OF THE FACTORIZING CODES (Q4513297) (← links)
- On codes having no finite completion (Q4763927) (← links)
- On the factorization conjecture (Q5096809) (← links)
- FINITE COMPLETIONS VIA FACTORIZING CODES (Q5386969) (← links)
- On codes with a finite deciphering delay: Constructing uncompletable words (Q5941067) (← links)
