On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
scientific article

    Statements

    On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    Complexity class separations
    0 references
    \(\mathcal{NL},\mathcal{NP}\)
    0 references
    Finite state automata intersection
    0 references

    Identifiers