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/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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institute of Informatics, Warsaw University, Poland", 
          "id": "http://www.grid.ac/institutes/grid.12847.38", 
          "name": [
            "Institute of Informatics, Warsaw University, Poland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rytter", 
        "givenName": "Wojciech", 
        "id": "sg:person.013534566577.61", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013534566577.61"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1985", 
    "datePublishedReg": "1985-01-01", 
    "description": "In this paper we present two results concerning the time and space complexity of context-free recognition. The first result states that cfl's can be recognized on a cube-connected computer (CCC) or on a perfect-shuffle computer (PSC) in log2n time using n6 processors. There are known algorithms with the same parallel time complexity but they use more powerful models of computation. The second result states that deterministic cfl's can be recognized in polynomial time using one log2n bounded pushdown store and log n tape. Known algorithms use log2n tape. Since algorithm is a simulation of a deterministic pda it may be looked upon as an efficient reduction of the height of the pushdown store. The second result is obtained by applying a transformation of a fast parallel recognition of deterministic cfl's and it can be viewed as an application of parallel algorithms to the design of efficient sequential algorithms.Both results are aimed not at improving the known complexity bounds, but rather at showing that the same complexity can be obtained on less powerful models of computation.", 
    "editor": [
      {
        "familyName": "Skowron", 
        "givenName": "Andrzej", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-16066-3_26", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-16066-3", 
        "978-3-540-39748-9"
      ], 
      "name": "Computation Theory", 
      "type": "Book"
    }, 
    "keywords": [
      "perfect shuffle computer", 
      "deterministic CFLs", 
      "parallel time complexity", 
      "efficient sequential algorithm", 
      "context-free recognition", 
      "parallel algorithm", 
      "time complexity", 
      "space complexity", 
      "pushdown store", 
      "sequential algorithm", 
      "parallel recognition", 
      "polynomial time", 
      "log2n time", 
      "powerful model", 
      "complexity bounds", 
      "context-free languages", 
      "algorithm", 
      "same complexity", 
      "second result states", 
      "computer", 
      "complexity", 
      "first result states", 
      "computation", 
      "recognition", 
      "processors", 
      "n tape", 
      "deterministic PDA", 
      "result states", 
      "stores", 
      "PDA", 
      "language", 
      "log2n", 
      "model", 
      "applications", 
      "efficient reduction", 
      "time", 
      "bounds", 
      "CFL", 
      "design", 
      "second result", 
      "simulations", 
      "results", 
      "state", 
      "transformation", 
      "tape", 
      "reduction", 
      "height", 
      "paper"
    ], 
    "name": "On the recognition of context-free languages", 
    "pagination": "318-325", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1044960546"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-16066-3_26"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-16066-3_26", 
      "https://app.dimensions.ai/details/publication/pub.1044960546"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:15", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_191.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-16066-3_26"
  }
]

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.

107 TRIPLES      22 PREDICATES      73 URIs      66 LITERALS      7 BLANK NODES