Constructing partial words with subword complexities not achievable by full words (Q428848): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.039 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031089489 / rank | |||
Normal rank |
Revision as of 01:58, 20 March 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