Complexity of universality and related problems for partially ordered NFAs (Q2013561)

From MaRDI portal
Revision as of 05:16, 14 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
Complexity of universality and related problems for partially ordered NFAs
scientific article

    Statements

    title
    Complexity of universality and related problems for partially ordered NFAs (English)
    0 references
    author
    Markus Krötzsch
    0 references
    Tomáš Masopust
    0 references
    Michaël Thomazo
    0 references
    publication date
    8 August 2017
    0 references
    zbMATH Keywords
    automata
    0 references
    nondeterminism
    0 references
    partial order
    0 references
    universality
    0 references
    inclusion
    0 references
    equivalence
    0 references
    cites work
    Q3292904
    0 references
    Q5437181
    0 references
    Q4198056
    0 references
    Q5738937
    0 references
    Q4133162
    0 references
    Q4608624
    0 references
    Around Dot Depth Two
    0 references
    Q4608630
    0 references
    Q2955031
    0 references
    Q2893312
    0 references
    Q4737911
    0 references
    Q4131648
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6758670
    0 references
    OpenAlex ID
    W2519230465
    0 references
    arXiv ID
    1609.03460
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2013561&oldid=36338006"
    Powered by MediaWiki