The complexity of intersecting finite automata having few final states (Q347114)

From MaRDI portal
Revision as of 01:13, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of intersecting finite automata having few final states
scientific article

    Statements

    The complexity of intersecting finite automata having few final states (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2016
    0 references
    finite automata
    0 references
    intersection problem
    0 references
    monoids
    0 references
    logspace
    0 references
    NP-completeness
    0 references
    point-spread problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references