The following pages link to Minimal complete sets of words (Q1145771):
Displaying 10 items.
- On incomplete and synchronizing finite sets (Q517035) (← links)
- Noncommutative factorization of variable-length codes (Q1094145) (← links)
- A conjecture on continued fractions (Q1275461) (← links)
- Some combinatorial results on Bernoulli sets and codes (Q1605333) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- Completions in measure of languages and related combinatorial problems (Q1763700) (← links)
- Coding by minimal linear grammars (Q2192369) (← links)
- On the length of uncompletable words in unambiguous automata (Q5108371) (← links)
- On codes with a finite deciphering delay: Constructing uncompletable words (Q5941067) (← links)
- On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)