The complexity of regular DNLC graph languages (Q909473)

From MaRDI portal
Revision as of 01:35, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The complexity of regular DNLC graph languages
scientific article

    Statements

    title
    The complexity of regular DNLC graph languages (English)
    0 references
    author
    Joost Engelfriet
    0 references
    Grzegorz Rozenberg
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    graph grammars
    0 references
    dependence graph languages
    0 references
    event structure languages
    0 references
    complexity of the membership problem
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    03D15
    0 references
    68Q25
    0 references
    zbMATH DE Number
    4137335
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q909473&oldid=25864616"
    Powered by MediaWiki