A linear-time algorithm to decide whether a binary word contains an overlap (Q3789095)
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: A linear-time algorithm to decide whether a binary word contains an overlap |
scientific article; zbMATH DE number 4053052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm to decide whether a binary word contains an overlap |
scientific article; zbMATH DE number 4053052 |
Statements
A linear-time algorithm to decide whether a binary word contains an overlap (English)
0 references
1988
0 references
linear-time algorithm
0 references
overlap-free binary words
0 references
0.8561851382255554
0 references
0.8008409142494202
0 references
0.8008404970169067
0 references
