Solid codes and the uniform density of fd-domains. (Q2461500): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:33, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solid codes and the uniform density of fd-domains. |
scientific article |
Statements
Solid codes and the uniform density of fd-domains. (English)
0 references
28 November 2007
0 references
The authors study coding properties of languages, i.e. subsets \(L\subseteq A^*\) for alphabets \(A\). The paper employs solid codes to settle an open problem: every fd-domain is uniformly dense.
0 references
solid codes
0 references
fd-domains
0 references
dense languages
0 references
