Ontology type: schema:Chapter
2020-11-06
AUTHORSManfred Droste , Zoltán Fülöp , Dávid Kószó , Heiko Vogler
ABSTRACTA weighted tree automaton is crisp-deterministic if it is deterministic and each of its transitions carries either the additive or multiplicative unit of the underlying weight algebra; weights different from these units may only appear at the root of the given input tree. A weighted tree automaton is crisp-determinizable if there exists an equivalent crisp-deterministic one. We prove that it is decidable whether weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids are crisp-determinizable. More... »
PAGES39-51
Descriptional Complexity of Formal Systems
ISBN
978-3-030-62535-1
978-3-030-62536-8
http://scigraph.springernature.com/pub.10.1007/978-3-030-62536-8_4
DOIhttp://dx.doi.org/10.1007/978-3-030-62536-8_4
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1132401198
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/06",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Biological Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0607",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Plant Biology",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "University of Leipzig, Leipzig, Germany",
"id": "http://www.grid.ac/institutes/grid.9647.c",
"name": [
"University of Leipzig, Leipzig, Germany"
],
"type": "Organization"
},
"familyName": "Droste",
"givenName": "Manfred",
"id": "sg:person.010545141652.14",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010545141652.14"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "University of Szeged, Szeged, Hungary",
"id": "http://www.grid.ac/institutes/grid.9008.1",
"name": [
"University of Szeged, Szeged, Hungary"
],
"type": "Organization"
},
"familyName": "F\u00fcl\u00f6p",
"givenName": "Zolt\u00e1n",
"id": "sg:person.014007607055.43",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014007607055.43"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "University of Szeged, Szeged, Hungary",
"id": "http://www.grid.ac/institutes/grid.9008.1",
"name": [
"University of Szeged, Szeged, Hungary"
],
"type": "Organization"
},
"familyName": "K\u00f3sz\u00f3",
"givenName": "D\u00e1vid",
"id": "sg:person.013635021547.32",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013635021547.32"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Technische Universit\u00e4t Dresden, Dresden, Germany",
"id": "http://www.grid.ac/institutes/grid.4488.0",
"name": [
"Technische Universit\u00e4t Dresden, Dresden, Germany"
],
"type": "Organization"
},
"familyName": "Vogler",
"givenName": "Heiko",
"id": "sg:person.014562633673.93",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014562633673.93"
],
"type": "Person"
}
],
"datePublished": "2020-11-06",
"datePublishedReg": "2020-11-06",
"description": "A weighted tree automaton is crisp-deterministic if it is deterministic and each of its transitions carries either the additive or multiplicative unit of the underlying weight algebra; weights different from these units may only appear at the root of the given input tree. A weighted tree automaton is crisp-determinizable if there exists an equivalent crisp-deterministic one. We prove that it is decidable whether weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids are crisp-determinizable.",
"editor": [
{
"familyName": "Jir\u00e1skov\u00e1",
"givenName": "Galina",
"type": "Person"
},
{
"familyName": "Pighizzini",
"givenName": "Giovanni",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-030-62536-8_4",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-030-62535-1",
"978-3-030-62536-8"
],
"name": "Descriptional Complexity of Formal Systems",
"type": "Book"
},
"keywords": [
"weight algebra",
"multiplicative unit",
"finite",
"automata",
"algebra",
"bimonoids",
"strong bimonoids",
"tree automata",
"input trees",
"transition",
"Weighted Tree Automata",
"one",
"units",
"trees",
"roots",
"weight"
],
"name": "Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable",
"pagination": "39-51",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1132401198"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-030-62536-8_4"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-030-62536-8_4",
"https://app.dimensions.ai/details/publication/pub.1132401198"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-20T07:44",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_256.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-030-62536-8_4"
}
]
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/978-3-030-62536-8_4'
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/978-3-030-62536-8_4'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-62536-8_4'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-62536-8_4'
This table displays all metadata directly associated to this object as RDF triples.
108 TRIPLES
23 PREDICATES
41 URIs
34 LITERALS
7 BLANK NODES