The complexity of regular DNLC graph languages (Q909473)

From MaRDI portal
Revision as of 00:41, 7 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of regular DNLC graph languages
scientific article

    Statements

    The complexity of regular DNLC graph languages (English)
    0 references
    0 references
    0 references
    1990
    0 references
    graph grammars
    0 references
    dependence graph languages
    0 references
    event structure languages
    0 references
    complexity of the membership problem
    0 references

    Identifiers