ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400)

From MaRDI portal
Revision as of 03:32, 3 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 NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES
scientific article

    Statements

    title
    ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (English)
    0 references
    author
    Anil Ada
    0 references
    publication date
    6 September 2010
    0 references
    zbMATH Keywords
    communication complexity
    0 references
    regular languages
    0 references
    algebraic automata theory
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    22E46
    0 references
    53C35
    0 references
    57S20
    0 references
    zbMATH DE Number
    5779717
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3586400&oldid=35185637"
    Powered by MediaWiki