Constructing partial words with subword complexities not achievable by full words (Q428848)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing partial words with subword complexities not achievable by full words |
scientific article; zbMATH DE number 6049377
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing partial words with subword complexities not achievable by full words |
scientific article; zbMATH DE number 6049377 |
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
