On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116)

From MaRDI portal
Revision as of 02:00, 11 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
On the Complexity of k-Piecewise Testability and the Depth of Automata
scientific article

    Statements

    title
    On the Complexity of k-Piecewise Testability and the Depth of Automata (English)
    0 references
    author
    Tomáš Masopust
    0 references
    Michaël Thomazo
    0 references
    publication date
    10 November 2015
    0 references
    zbMATH DE Number
    6506909
    0 references
    OpenAlex ID
    W1145240173
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3451116&oldid=36212248"
    Powered by MediaWiki