On the state complexity of scattered substrings and superstrings (Q4932068)
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 state complexity of scattered substrings and superstrings |
scientific article; zbMATH DE number 5794262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the state complexity of scattered substrings and superstrings |
scientific article; zbMATH DE number 5794262 |
Statements
On the State Complexity of Scattered Substrings and Superstrings (English)
0 references
1 October 2010
0 references
descriptional complexity
0 references
finite automata
0 references
state complexity
0 references
substring
0 references
subword
0 references
subsequence
0 references
Higman-Haines sets
0 references
0.7359409928321838
0 references
0.73507159948349
0 references
0.7317099571228027
0 references
0.7293140292167664
0 references
0.7278259992599487
0 references
