Concatenation of graphs View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1996

AUTHORS

Joost Engelfriet , Jan Joris Vereijken

ABSTRACT

An operation of concatenation is defined for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a class K of string languages, Int(K) is the class of all graph languages that are interpretations of languages from K. For the class REG of regular languages, Int(REG) might be called the class of regular graph languages; it equals the class of graph languages generated by linear Hyperedge Replacement Systems. Two characterizations are given of the largest class K′ such that Int(K′)=Int(K). More... »

PAGES

368-382

Book

TITLE

Graph Grammars and Their Application to Computer Science

ISBN

978-3-540-61228-5
978-3-540-68388-9

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-61228-9_99

DOI

http://dx.doi.org/10.1007/3-540-61228-9_99

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1035997922


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/2004", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Linguistics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/20", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Language, Communication and Culture", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Leiden University", 
          "id": "https://www.grid.ac/institutes/grid.5132.5", 
          "name": [
            "Department of Computer Science, Leiden University, P.O.Box 9512, 2300\u00a0RA Leiden, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Engelfriet", 
        "givenName": "Joost", 
        "id": "sg:person.014574236321.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014574236321.39"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Leiden University", 
          "id": "https://www.grid.ac/institutes/grid.5132.5", 
          "name": [
            "Department of Computer Science, Leiden University, P.O.Box 9512, 2300\u00a0RA Leiden, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vereijken", 
        "givenName": "Jan Joris", 
        "id": "sg:person.016561367427.40", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016561367427.40"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1996", 
    "datePublishedReg": "1996-01-01", 
    "description": "An operation of concatenation is defined for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a class K of string languages, Int(K) is the class of all graph languages that are interpretations of languages from K. For the class REG of regular languages, Int(REG) might be called the class of regular graph languages; it equals the class of graph languages generated by linear Hyperedge Replacement Systems. Two characterizations are given of the largest class K\u2032 such that Int(K\u2032)=Int(K).", 
    "editor": [
      {
        "familyName": "Cuny", 
        "givenName": "Janice", 
        "type": "Person"
      }, 
      {
        "familyName": "Ehrig", 
        "givenName": "Hartmut", 
        "type": "Person"
      }, 
      {
        "familyName": "Engels", 
        "givenName": "Gregor", 
        "type": "Person"
      }, 
      {
        "familyName": "Rozenberg", 
        "givenName": "Grzegorz", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-61228-9_99", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-61228-5", 
        "978-3-540-68388-9"
      ], 
      "name": "Graph Grammars and Their Application to Computer Science", 
      "type": "Book"
    }, 
    "name": "Concatenation of graphs", 
    "pagination": "368-382", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-61228-9_99"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "ab7b56a2486b9939e5564ba28cc6941319fd5944b972ed91e3e475f74921980b"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1035997922"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-61228-9_99", 
      "https://app.dimensions.ai/details/publication/pub.1035997922"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T17:59", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8681_00000062.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/3-540-61228-9_99"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-61228-9_99'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-61228-9_99'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-61228-9_99'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-61228-9_99'


 

This table displays all metadata directly associated to this object as RDF triples.

87 TRIPLES      22 PREDICATES      27 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-61228-9_99 schema:about anzsrc-for:20
2 anzsrc-for:2004
3 schema:author N7b1baed8ca4840a7a52c7e1fbeb02adc
4 schema:datePublished 1996
5 schema:datePublishedReg 1996-01-01
6 schema:description An operation of concatenation is defined for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a class K of string languages, Int(K) is the class of all graph languages that are interpretations of languages from K. For the class REG of regular languages, Int(REG) might be called the class of regular graph languages; it equals the class of graph languages generated by linear Hyperedge Replacement Systems. Two characterizations are given of the largest class K′ such that Int(K′)=Int(K).
7 schema:editor N8e6b9ddb4345465b838c9a5692bb6282
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N747ec9c0882c4b9d9ecce9aefc49ed0b
12 schema:name Concatenation of graphs
13 schema:pagination 368-382
14 schema:productId N3a649eb5dd2c4a6ca04106e92dc8a519
15 N859c9620dfbb4902b196e1957e0f6844
16 Nc69d5156ae624d71b9c0af56d3758cc6
17 schema:publisher N19750d0e0ff24dd8b6687aee1a700ee3
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035997922
19 https://doi.org/10.1007/3-540-61228-9_99
20 schema:sdDatePublished 2019-04-15T17:59
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher Nb8acaddc42654f4385b27eddb7acc60f
23 schema:url http://link.springer.com/10.1007/3-540-61228-9_99
24 sgo:license sg:explorer/license/
25 sgo:sdDataset chapters
26 rdf:type schema:Chapter
27 N19750d0e0ff24dd8b6687aee1a700ee3 schema:location Berlin, Heidelberg
28 schema:name Springer Berlin Heidelberg
29 rdf:type schema:Organisation
30 N311d242fef6a41f6812cc6458b604a16 rdf:first sg:person.016561367427.40
31 rdf:rest rdf:nil
32 N3a649eb5dd2c4a6ca04106e92dc8a519 schema:name readcube_id
33 schema:value ab7b56a2486b9939e5564ba28cc6941319fd5944b972ed91e3e475f74921980b
34 rdf:type schema:PropertyValue
35 N563138a8262d4329be2a6e5dcafa0ee7 rdf:first Nb76c011a56de4455a4d625c463b63b00
36 rdf:rest N787f504369ee4b3da0960ee880170370
37 N747ec9c0882c4b9d9ecce9aefc49ed0b schema:isbn 978-3-540-61228-5
38 978-3-540-68388-9
39 schema:name Graph Grammars and Their Application to Computer Science
40 rdf:type schema:Book
41 N787f504369ee4b3da0960ee880170370 rdf:first N8b20d68d4ebe448997d8140e202f61e9
42 rdf:rest rdf:nil
43 N7b1baed8ca4840a7a52c7e1fbeb02adc rdf:first sg:person.014574236321.39
44 rdf:rest N311d242fef6a41f6812cc6458b604a16
45 N859c9620dfbb4902b196e1957e0f6844 schema:name doi
46 schema:value 10.1007/3-540-61228-9_99
47 rdf:type schema:PropertyValue
48 N8b20d68d4ebe448997d8140e202f61e9 schema:familyName Rozenberg
49 schema:givenName Grzegorz
50 rdf:type schema:Person
51 N8e6b9ddb4345465b838c9a5692bb6282 rdf:first Na064115aea634878b5cf2e43c3aa9567
52 rdf:rest Ne75a25f29ca24eba96c2d5212579303b
53 Na064115aea634878b5cf2e43c3aa9567 schema:familyName Cuny
54 schema:givenName Janice
55 rdf:type schema:Person
56 Nb76c011a56de4455a4d625c463b63b00 schema:familyName Engels
57 schema:givenName Gregor
58 rdf:type schema:Person
59 Nb8acaddc42654f4385b27eddb7acc60f schema:name Springer Nature - SN SciGraph project
60 rdf:type schema:Organization
61 Nc69d5156ae624d71b9c0af56d3758cc6 schema:name dimensions_id
62 schema:value pub.1035997922
63 rdf:type schema:PropertyValue
64 Ncc6cf69737bf4958a7a41c6367731fe3 schema:familyName Ehrig
65 schema:givenName Hartmut
66 rdf:type schema:Person
67 Ne75a25f29ca24eba96c2d5212579303b rdf:first Ncc6cf69737bf4958a7a41c6367731fe3
68 rdf:rest N563138a8262d4329be2a6e5dcafa0ee7
69 anzsrc-for:20 schema:inDefinedTermSet anzsrc-for:
70 schema:name Language, Communication and Culture
71 rdf:type schema:DefinedTerm
72 anzsrc-for:2004 schema:inDefinedTermSet anzsrc-for:
73 schema:name Linguistics
74 rdf:type schema:DefinedTerm
75 sg:person.014574236321.39 schema:affiliation https://www.grid.ac/institutes/grid.5132.5
76 schema:familyName Engelfriet
77 schema:givenName Joost
78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014574236321.39
79 rdf:type schema:Person
80 sg:person.016561367427.40 schema:affiliation https://www.grid.ac/institutes/grid.5132.5
81 schema:familyName Vereijken
82 schema:givenName Jan Joris
83 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016561367427.40
84 rdf:type schema:Person
85 https://www.grid.ac/institutes/grid.5132.5 schema:alternateName Leiden University
86 schema:name Department of Computer Science, Leiden University, P.O.Box 9512, 2300 RA Leiden, The Netherlands
87 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...