Parikh’s Theorem and Descriptional Complexity (Q2891382)

From MaRDI portal
Revision as of 08:03, 5 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
Parikh’s Theorem and Descriptional Complexity
scientific article

    Statements

    title
    Parikh’s Theorem and Descriptional Complexity (English)
    0 references
    author
    Giovanna J. Lavado
    0 references
    Giovanni Pighizzini
    0 references
    publication date
    15 June 2012
    0 references
    zbMATH Keywords
    finite automata
    0 references
    formal languages
    0 references
    context-free languages
    0 references
    descriptional complexity
    0 references
    Parikh's theorem
    0 references
    bounded languages
    0 references

    Identifiers

    zbMATH DE Number
    6046542
    0 references
    Wikidata QID
    Q61677507
    0 references
    OpenAlex ID
    W2048510
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2891382&oldid=35284413"
    Powered by MediaWiki