A linear-time algorithm to decide whether a binary word contains an overlap (Q3789095)

From MaRDI portal
Revision as of 06:13, 19 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
A linear-time algorithm to decide whether a binary word contains an overlap
scientific article

    Statements

    A linear-time algorithm to decide whether a binary word contains an overlap (English)
    0 references
    0 references
    1988
    0 references
    linear-time algorithm
    0 references
    overlap-free binary words
    0 references

    Identifiers