1968-06
AUTHORSSeymour Ginsburg, Edwin H. Spanier
ABSTRACTGiven a setC of strings of rewriting rules of a phrase structure grammarG, we consider the setLc(G) of those words generated by leftmost derivations inG whose corresponding string of rewriting rules is an element ofC. The paper concerns the nature of the setLc(G) whenC andG are assumed to have special form. For example, forG an arbitrary phrase structure grammar,Lc(G) is an abstract family of languages ifC is an abstract family of languages, andLc(G) is bounded ifC is bounded. More... »
PAGES159-177
http://scigraph.springernature.com/pub.10.1007/bf01692513
DOIhttp://dx.doi.org/10.1007/bf01692513
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1037066141
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": "System Development Corporation, Santa Monica, California, USA",
"id": "http://www.grid.ac/institutes/grid.421970.9",
"name": [
"University of Southern California, USA",
"System Development Corporation, Santa Monica, California, USA"
],
"type": "Organization"
},
"familyName": "Ginsburg",
"givenName": "Seymour",
"id": "sg:person.011764026327.08",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011764026327.08"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "System Development Corporation, USA",
"id": "http://www.grid.ac/institutes/grid.421970.9",
"name": [
"University of California, Berkeley, USA",
"System Development Corporation, USA"
],
"type": "Organization"
},
"familyName": "Spanier",
"givenName": "Edwin H.",
"id": "sg:person.013016640707.66",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013016640707.66"
],
"type": "Person"
}
],
"datePublished": "1968-06",
"datePublishedReg": "1968-06-01",
"description": "Given a setC of strings of rewriting rules of a phrase structure grammarG, we consider the setLc(G) of those words generated by leftmost derivations inG whose corresponding string of rewriting rules is an element ofC. The paper concerns the nature of the setLc(G) whenC andG are assumed to have special form. For example, forG an arbitrary phrase structure grammar,Lc(G) is an abstract family of languages ifC is an abstract family of languages, andLc(G) is bounded ifC is bounded.",
"genre": "article",
"id": "sg:pub.10.1007/bf01692513",
"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": "2",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "2"
}
],
"keywords": [
"abstract family",
"Phrase Structure Grammar",
"Structure Grammar",
"grammar",
"language",
"words",
"ing",
"special form",
"rules",
"strings",
"family",
"form",
"nature",
"example",
"elements",
"paper",
"IFC",
"control",
"SETC",
"whenC",
"forG"
],
"name": "Control sets on grammars",
"pagination": "159-177",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1037066141"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/bf01692513"
]
}
],
"sameAs": [
"https://doi.org/10.1007/bf01692513",
"https://app.dimensions.ai/details/publication/pub.1037066141"
],
"sdDataset": "articles",
"sdDatePublished": "2022-06-01T22:20",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/article/article_81.jsonl",
"type": "ScholarlyArticle",
"url": "https://doi.org/10.1007/bf01692513"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
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/bf01692513'
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/bf01692513'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf01692513'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf01692513'
This table displays all metadata directly associated to this object as RDF triples.
102 TRIPLES
21 PREDICATES
50 URIs
39 LITERALS
6 BLANK NODES