A Greibach normal form for context-free graph grammars (Q5204313): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-55719-9_70 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152195025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding uniform emulations on paths and ring networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of boundary and confluent graph grammars on graph languages of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string generating power of context-free hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free hypergraph grammars have the same term-generating power as attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph languages of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free graph languages of bounded degree are generated by apex graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear graph grammars: Power and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Apex graph grammars and attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonterminal separation in graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary graph grammars with dynamic edge relabeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of boundary graph grammars and context-free hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation-bounded languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Equations and Normal Forms for Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694744 / rank
 
Normal rank

Latest revision as of 04:01, 21 July 2024

scientific article; zbMATH DE number 7139627
Language Label Description Also known as
English
A Greibach normal form for context-free graph grammars
scientific article; zbMATH DE number 7139627

    Statements

    A Greibach normal form for context-free graph grammars (English)
    0 references
    4 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers