This HTML5 document contains 27 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n9http://dl.acm.org/
n15http://citeseerx.ist.psu.edu/viewdoc/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n17http://dspace.mit.edu/bitstream/handle/1721.1/7085/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
n16http://dspace.mit.edu/bitstream/handle/1721.1/13191/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Linear_graph_grammar
rdfs:label
Linear graph grammar
rdfs:comment
In computer science, a linear graph grammar (also a connection graph reduction system or a port graph grammar) is a class of graph grammar on which nodes have a number of ports connected together by edges and edges connect exactly two ports together. Interaction nets are a special subclass of linear graph grammars in which rewriting is confluent.
dcterms:subject
dbc:Graph_rewriting
dbo:wikiPageID
51752859
dbo:wikiPageRevisionID
760567833
dbo:wikiPageWikiLink
dbr:Interaction_net dbr:Computer_science dbr:Confluence_(abstract_rewriting) dbr:Graph_grammar dbc:Graph_rewriting dbr:Rewriting dbr:MIT dbr:Scheme_programming_language dbr:ACM_Press dbr:Brandeis_University
dbo:wikiPageExternalLink
n9:citation.cfm%3Fid=319868 n15:download%3Fdoi=10.1.1.25.5189&rep=rep1&type=pdf n16:26680868-MIT.pdf%3Fsequence=2 n17:AITR-1627.pdf%3Fsequence%3D2
owl:sameAs
wikidata:Q28403570 n18:2dthG
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Computer-science-stub
dbo:abstract
In computer science, a linear graph grammar (also a connection graph reduction system or a port graph grammar) is a class of graph grammar on which nodes have a number of ports connected together by edges and edges connect exactly two ports together. Interaction nets are a special subclass of linear graph grammars in which rewriting is confluent.
prov:wasDerivedFrom
wikipedia-en:Linear_graph_grammar?oldid=760567833&ns=0
dbo:wikiPageLength
1872
foaf:isPrimaryTopicOf
wikipedia-en:Linear_graph_grammar