Testing avoidability on sets of partial words is hard (Q1006080)

From MaRDI portal
Revision as of 20:27, 19 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q591667)
scientific article
Language Label Description Also known as
English
Testing avoidability on sets of partial words is hard
scientific article

    Statements

    Testing avoidability on sets of partial words is hard (English)
    0 references
    0 references
    0 references
    17 March 2009
    0 references
    combinatorics on words
    0 references
    partial words
    0 references
    unavoidable sets
    0 references
    3SAT problem
    0 references
    NP-hard problems
    0 references

    Identifiers