Communication complexity method for measuring nondeterminism in finite automata (Q1854501)

From MaRDI portal
Revision as of 10:13, 5 June 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
Communication complexity method for measuring nondeterminism in finite automata
scientific article

    Statements

    title
    Communication complexity method for measuring nondeterminism in finite automata (English)
    0 references
    author
    Sebastian Seibert
    0 references
    Hartmut Klauck
    0 references
    Georg Schnitger
    0 references
    Juraj Hromkovič
    0 references
    Juhani Karhumäki
    0 references
    publication date
    14 January 2003
    0 references
    cites work
    Q5541339
    0 references
    Q4938639
    0 references
    Q4337605
    0 references
    Q2754144
    0 references
    Q4788609
    0 references
    Q5203681
    0 references
    Q4228510
    0 references
    Q3768423
    0 references
    Q4079524
    0 references
    Q3742754
    0 references
    Q4258580
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q17
    0 references
    68Q10
    0 references
    zbMATH DE Number
    1853236
    0 references
    Wikidata QID
    Q58040242
    0 references
    OpenAlex ID
    W2057747677
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1854501&oldid=34330197"
    Powered by MediaWiki