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/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0102", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Applied Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0805", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Distributed Computing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Teleinformatics, noll@it.kth.se, Royal Institute of Technology (KTH), Electrum 204, S-16440 Kista, Sweden, SE", 
          "id": "http://www.grid.ac/institutes/grid.5037.1", 
          "name": [
            "Department of Teleinformatics, noll@it.kth.se, Royal Institute of Technology (KTH), Electrum 204, S-16440 Kista, Sweden, SE"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Noll", 
        "givenName": "T.", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Institut für Softwaretechnik I,vogler@inf.tu-dresden.de, Dresden University of Technology,   D-01062 Dresden, Germany, DE", 
          "id": "http://www.grid.ac/institutes/grid.4488.0", 
          "name": [
            "Institut für Softwaretechnik I,vogler@inf.tu-dresden.de, Dresden University of Technology,   D-01062 Dresden, Germany, DE"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vogler", 
        "givenName": "H.", 
        "id": "sg:person.014562633673.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014562633673.93"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2000-02", 
    "datePublishedReg": "2000-02-01", 
    "description": "Abstract.  In this paper we present higher-order attributed tree transducers as a formal computational model for higher-order attribute grammars. The latter is a generalization of the classical concept of attribute grammars in the sense that during attribute evaluation, the input tree can be enlarged by inserting subtrees which were computed during attribute evaluation. We prove the universality of this formalism by showing that the class of functions described by higher-order attributed tree transducers coincides with the class of (partial) recursive tree functions.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s002240010018", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1052098", 
        "issn": [
          "1432-4350", 
          "1433-0490"
        ], 
        "name": "Theory of Computing Systems", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "34"
      }
    ], 
    "keywords": [
      "evaluation", 
      "function", 
      "transducer", 
      "class", 
      "computational model", 
      "model", 
      "classical concept", 
      "attribute evaluation", 
      "latter", 
      "concept", 
      "sense", 
      "coincide", 
      "trees", 
      "higher-order attribute grammars", 
      "generalization", 
      "paper", 
      "formal computational model", 
      "class of functions", 
      "universality", 
      "attribute grammars", 
      "grammar", 
      "subtrees", 
      "formalism", 
      "tree transducers", 
      "input trees", 
      "tree function"
    ], 
    "name": "The Universality of Higher-Order Attributed Tree Transducers", 
    "pagination": "45-75", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1042624052"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s002240010018"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s002240010018", 
      "https://app.dimensions.ai/details/publication/pub.1042624052"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-10T09:48", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/article/article_320.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s002240010018"
  }
]

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

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

105 TRIPLES      21 PREDICATES      55 URIs      44 LITERALS      6 BLANK NODES