The complexity of regular DNLC graph languages (Q909473): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57402283, #quickstatements; #temporary_batch_1714629218081
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of regular DNLC graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the membership problem for regular DNLC grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traces, dependency graphs and DNLC grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear graph grammars: Power and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of boundary graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of context-free string languages by directed node- label controlled graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape-bounded complexity classes and multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank

Latest revision as of 12:32, 20 June 2024

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