Number of holes in unavoidable sets of partial words. II. (Q450549)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6082045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Number of holes in unavoidable sets of partial words. II. |
scientific article; zbMATH DE number 6082045 |
Statements
Number of holes in unavoidable sets of partial words. II. (English)
0 references
13 September 2012
0 references
automata and formal languages
0 references
computational complexity
0 references
combinatorics on words
0 references
partial words
0 references
unavoidable sets
0 references
NP-hard problems
0 references
0.9188725352287292
0 references
0.8978378176689148
0 references
0.8905704021453857
0 references
0.8887902498245239
0 references
0.8631083965301514
0 references
