From imperative to rule-based graph programs (Q516038): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow diagrams, turing machines and languages with only two formation rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of algebraic graph transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural approach to operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graph Programming Language GP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hoare-Style Verification of Graph Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A system of graph grammars which generates all recursively enumerable sets of labelled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751553 / rank
 
Normal rank

Revision as of 13:23, 13 July 2024

scientific article
Language Label Description Also known as
English
From imperative to rule-based graph programs
scientific article

    Statements

    From imperative to rule-based graph programs (English)
    0 references
    0 references
    20 March 2017
    0 references
    graph programs
    0 references
    GP 2
    0 references
    rule-based programming
    0 references
    computational completeness
    0 references
    random access machines
    0 references
    graph transformation
    0 references

    Identifiers