Handle-rewriting hypergraph grammars (Q2366278): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Grzegorz Rozenberg / rank
Normal rank
 
Property / author
 
Property / author: Grzegorz Rozenberg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars / 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: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / 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: Q4037312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037316 / 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: Linear graph grammars: Power and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785994 / 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: 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: Q3325062 / 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: Q3316615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle NLC grammars and r. e. languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-label controlled graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(93)90004-g / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994887153 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Handle-rewriting hypergraph grammars
scientific article

    Statements

    Handle-rewriting hypergraph grammars (English)
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    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
    0 references

    Identifiers