A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q125020224, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Restrictions on NLC graph grammars / 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: On the structure of node-label-controlled graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions, extensions, and variations of NLC grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded degree problem for NLC grammars is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and Context-Free Graph Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic closure properties of the family of boundary NLC graph languages / 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: The generating power of boundary NLC graph grammars and cycle graphs / rank
 
Normal rank

Latest revision as of 17:02, 22 May 2024

scientific article
Language Label Description Also known as
English
A pumping lemma and the structure of derivations in the boundary NLC graph languages
scientific article

    Statements