On the complexity of deciding avoidability of sets of partial words (Q606993)
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: On the complexity of deciding avoidability of sets of partial words |
scientific article; zbMATH DE number 5817532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of deciding avoidability of sets of partial words |
scientific article; zbMATH DE number 5817532 |
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
0.9978188276290894
0 references
0.909712016582489
0 references
0.8497148752212524
0 references
0.8414844870567322
0 references
