On the complexity of deciding avoidability of sets of partial words (Q606993): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.09.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.09.006 / rank | |||
Normal rank | |||
Latest revision as of 22:09, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding avoidability of sets of partial words |
scientific article |
Statements
On the complexity of deciding avoidability of sets of partial words (English)
0 references
19 November 2010
0 references
computational complexity
0 references
combinatorics on words
0 references
partial words
0 references
unavoidable sets
0 references
NP-hard problems
0 references
de Bruijn graphs
0 references
0 references
