Constructing partial words with subword complexities not achievable by full words (Q428848): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q235665 |
||
| Property / author | |||
| Property / author: Q418739 / rank | |||
Revision as of 15:17, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing partial words with subword complexities not achievable by full words |
scientific article |
Statements
Constructing partial words with subword complexities not achievable by full words (English)
0 references
25 June 2012
0 references
automata and formal languages
0 references
combinatorics on words
0 references
partial words
0 references
subword complexity
0 references
polynomial complexity
0 references
intermediate complexity
0 references
