A characterization of context-free string languages by directed node- label controlled graph grammars (Q1154289): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sequence Equivalence Problem is Decidable for 0S Systems / 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: Q3666286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank

Revision as of 12:42, 13 June 2024

scientific article
Language Label Description Also known as
English
A characterization of context-free string languages by directed node- label controlled graph grammars
scientific article

    Statements

    A characterization of context-free string languages by directed node- label controlled graph grammars (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    sequential graph rewriting systems
    0 references
    context-free languages
    0 references