Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Double_pushout_graph_rewriting> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Double_pushout_graph_rewriting abstract "In computer science, double pushout graph rewriting or (DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973). It has since been generalized to allow rewriting structures which are not graphs, and to handle negative application conditions, among other extensions.".
- Double_pushout_graph_rewriting wikiPageID "35717039".
- Double_pushout_graph_rewriting wikiPageLength "4605".
- Double_pushout_graph_rewriting wikiPageOutDegree "21".
- Double_pushout_graph_rewriting wikiPageRevisionID "668401797".
- Double_pushout_graph_rewriting wikiPageWikiLink Adhesive_category.
- Double_pushout_graph_rewriting wikiPageWikiLink Attributed_graph.
- Double_pushout_graph_rewriting wikiPageWikiLink Category:Graph_algorithms.
- Double_pushout_graph_rewriting wikiPageWikiLink Category:Graph_rewriting.
- Double_pushout_graph_rewriting wikiPageWikiLink Category_(mathematics).
- Double_pushout_graph_rewriting wikiPageWikiLink Computer_science.
- Double_pushout_graph_rewriting wikiPageWikiLink Concurrency.
- Double_pushout_graph_rewriting wikiPageWikiLink Coproduct.
- Double_pushout_graph_rewriting wikiPageWikiLink Graph_(mathematics).
- Double_pushout_graph_rewriting wikiPageWikiLink Graph_rewriting.
- Double_pushout_graph_rewriting wikiPageWikiLink Halting_problem.
- Double_pushout_graph_rewriting wikiPageWikiLink Hypergraph.
- Double_pushout_graph_rewriting wikiPageWikiLink Monomorphism.
- Double_pushout_graph_rewriting wikiPageWikiLink Petri_net.
- Double_pushout_graph_rewriting wikiPageWikiLink Petri_nets.
- Double_pushout_graph_rewriting wikiPageWikiLink Post_correspondence_problem.
- Double_pushout_graph_rewriting wikiPageWikiLink Pushout_(category_theory).
- Double_pushout_graph_rewriting wikiPageWikiLink Span_(category_theory).
- Double_pushout_graph_rewriting wikiPageWikiLink Typed_graph.
- Double_pushout_graph_rewriting wikiPageWikiLink Undecidable_problem.
- Double_pushout_graph_rewriting wikiPageWikiLinkText "Double pushout graph rewriting".
- Double_pushout_graph_rewriting wikiPageWikiLinkText "double-pushout (DPO) approach".
- Double_pushout_graph_rewriting hasPhotoCollection Double_pushout_graph_rewriting.
- Double_pushout_graph_rewriting subject Category:Graph_algorithms.
- Double_pushout_graph_rewriting subject Category:Graph_rewriting.
- Double_pushout_graph_rewriting comment "In computer science, double pushout graph rewriting or (DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973). It has since been generalized to allow rewriting structures which are not graphs, and to handle negative application conditions, among other extensions.".
- Double_pushout_graph_rewriting label "Double pushout graph rewriting".
- Double_pushout_graph_rewriting sameAs m.0zc0vt0.
- Double_pushout_graph_rewriting sameAs Q17009459.
- Double_pushout_graph_rewriting sameAs Q17009459.
- Double_pushout_graph_rewriting wasDerivedFrom Double_pushout_graph_rewriting?oldid=668401797.
- Double_pushout_graph_rewriting isPrimaryTopicOf Double_pushout_graph_rewriting.