On the complexity of deciding avoidability of sets of partial words (Q606993): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:51, 30 January 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
