Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2013

AUTHORS

Zoltán Fülöp , Andreas Maletti

ABSTRACT

The expressive power of compositions of linear extended top-down tree transducers with and without regular look-ahead is investigated. In particular, the restrictions of ε-freeness, strictness, and nondeletion are considered. The composition hierarchy is finite for all ε-free variants of these transducers except for ε-free nondeleting linear extended top-down tree transducers. The least number of transducers needed for the full expressive power of arbitrary compositions is presented. More... »

PAGES

239-251

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-38771-5_22

DOI

http://dx.doi.org/10.1007/978-3-642-38771-5_22

DIMENSIONS

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


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/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": "Department of Foundations of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r\u00a02, H-6720, Szeged, Hungary", 
          "id": "http://www.grid.ac/institutes/grid.9008.1", 
          "name": [
            "Department of Foundations of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r\u00a02, H-6720, 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": "Institute for Natural Language Processing, University of Stuttgart, Pfaffenwaldring 5b, 70569, Stuttgart, Germany", 
          "id": "http://www.grid.ac/institutes/grid.5719.a", 
          "name": [
            "Institute for Natural Language Processing, University of Stuttgart, Pfaffenwaldring 5b, 70569, Stuttgart, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maletti", 
        "givenName": "Andreas", 
        "id": "sg:person.016645332751.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016645332751.01"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2013", 
    "datePublishedReg": "2013-01-01", 
    "description": "The expressive power of compositions of linear extended top-down tree transducers with and without regular look-ahead is investigated. In particular, the restrictions of \u03b5-freeness, strictness, and nondeletion are considered. The composition hierarchy is finite for all \u03b5-free variants of these transducers except for \u03b5-free nondeleting linear extended top-down tree transducers. The least number of transducers needed for the full expressive power of arbitrary compositions is presented.", 
    "editor": [
      {
        "familyName": "B\u00e9al", 
        "givenName": "Marie-Pierre", 
        "type": "Person"
      }, 
      {
        "familyName": "Carton", 
        "givenName": "Olivier", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-38771-5_22", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-38770-8", 
        "978-3-642-38771-5"
      ], 
      "name": "Developments in Language Theory", 
      "type": "Book"
    }, 
    "keywords": [
      "power", 
      "composition", 
      "transducer", 
      "restriction", 
      "strictness", 
      "nondeletion", 
      "free variant", 
      "variants", 
      "least number", 
      "number", 
      "arbitrary composition", 
      "closure", 
      "expressive power", 
      "tree transducers", 
      "freeness", 
      "composition hierarchy", 
      "hierarchy", 
      "free nondeleting linear", 
      "nondeleting linear", 
      "linear", 
      "full expressive power", 
      "composition closure", 
      "Free Linear Extended Top-Down Tree Transducers", 
      "Linear Extended Top-Down Tree Transducers", 
      "Extended Top-Down Tree Transducers", 
      "Top-Down Tree Transducers"
    ], 
    "name": "Composition Closure of \u03b5-Free Linear Extended Top-Down Tree Transducers", 
    "pagination": "239-251", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1010668532"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-38771-5_22"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-38771-5_22", 
      "https://app.dimensions.ai/details/publication/pub.1010668532"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T18:56", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/chapter/chapter_339.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-38771-5_22"
  }
]
 

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/978-3-642-38771-5_22'

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-642-38771-5_22'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-38771-5_22'

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-642-38771-5_22'


 

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

101 TRIPLES      23 PREDICATES      52 URIs      45 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-38771-5_22 schema:about anzsrc-for:06
2 anzsrc-for:0607
3 schema:author Nc962f777167543cd9fcf7c387c180c5e
4 schema:datePublished 2013
5 schema:datePublishedReg 2013-01-01
6 schema:description The expressive power of compositions of linear extended top-down tree transducers with and without regular look-ahead is investigated. In particular, the restrictions of ε-freeness, strictness, and nondeletion are considered. The composition hierarchy is finite for all ε-free variants of these transducers except for ε-free nondeleting linear extended top-down tree transducers. The least number of transducers needed for the full expressive power of arbitrary compositions is presented.
7 schema:editor Ndffab6d347d7412a9947023d09b9ed58
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N4005797286e64a3e981eb90ba60027d2
12 schema:keywords Extended Top-Down Tree Transducers
13 Free Linear Extended Top-Down Tree Transducers
14 Linear Extended Top-Down Tree Transducers
15 Top-Down Tree Transducers
16 arbitrary composition
17 closure
18 composition
19 composition closure
20 composition hierarchy
21 expressive power
22 free nondeleting linear
23 free variant
24 freeness
25 full expressive power
26 hierarchy
27 least number
28 linear
29 nondeleting linear
30 nondeletion
31 number
32 power
33 restriction
34 strictness
35 transducer
36 tree transducers
37 variants
38 schema:name Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers
39 schema:pagination 239-251
40 schema:productId N3edd34977a97460fac38c3d9e3538d94
41 Nb55b6f836b2a4fefaf59d198619feaae
42 schema:publisher N169b317a847b4719bd73006577025544
43 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010668532
44 https://doi.org/10.1007/978-3-642-38771-5_22
45 schema:sdDatePublished 2021-11-01T18:56
46 schema:sdLicense https://scigraph.springernature.com/explorer/license/
47 schema:sdPublisher N104cb2fb150d4f8f82e2f481689179ed
48 schema:url https://doi.org/10.1007/978-3-642-38771-5_22
49 sgo:license sg:explorer/license/
50 sgo:sdDataset chapters
51 rdf:type schema:Chapter
52 N104cb2fb150d4f8f82e2f481689179ed schema:name Springer Nature - SN SciGraph project
53 rdf:type schema:Organization
54 N169b317a847b4719bd73006577025544 schema:name Springer Nature
55 rdf:type schema:Organisation
56 N2a4f2a4e9d8e4233b3fab9003a74b117 rdf:first Nc7ab5a0e8b6243cc9937a612eb23423e
57 rdf:rest rdf:nil
58 N3edd34977a97460fac38c3d9e3538d94 schema:name dimensions_id
59 schema:value pub.1010668532
60 rdf:type schema:PropertyValue
61 N4005797286e64a3e981eb90ba60027d2 schema:isbn 978-3-642-38770-8
62 978-3-642-38771-5
63 schema:name Developments in Language Theory
64 rdf:type schema:Book
65 N7d7e951a3455446490dcc38f1f688838 rdf:first sg:person.016645332751.01
66 rdf:rest rdf:nil
67 Nac8e257296654e35a9776ec1e0716a82 schema:familyName Béal
68 schema:givenName Marie-Pierre
69 rdf:type schema:Person
70 Nb55b6f836b2a4fefaf59d198619feaae schema:name doi
71 schema:value 10.1007/978-3-642-38771-5_22
72 rdf:type schema:PropertyValue
73 Nc7ab5a0e8b6243cc9937a612eb23423e schema:familyName Carton
74 schema:givenName Olivier
75 rdf:type schema:Person
76 Nc962f777167543cd9fcf7c387c180c5e rdf:first sg:person.014007607055.43
77 rdf:rest N7d7e951a3455446490dcc38f1f688838
78 Ndffab6d347d7412a9947023d09b9ed58 rdf:first Nac8e257296654e35a9776ec1e0716a82
79 rdf:rest N2a4f2a4e9d8e4233b3fab9003a74b117
80 anzsrc-for:06 schema:inDefinedTermSet anzsrc-for:
81 schema:name Biological Sciences
82 rdf:type schema:DefinedTerm
83 anzsrc-for:0607 schema:inDefinedTermSet anzsrc-for:
84 schema:name Plant Biology
85 rdf:type schema:DefinedTerm
86 sg:person.014007607055.43 schema:affiliation grid-institutes:grid.9008.1
87 schema:familyName Fülöp
88 schema:givenName Zoltán
89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014007607055.43
90 rdf:type schema:Person
91 sg:person.016645332751.01 schema:affiliation grid-institutes:grid.5719.a
92 schema:familyName Maletti
93 schema:givenName Andreas
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016645332751.01
95 rdf:type schema:Person
96 grid-institutes:grid.5719.a schema:alternateName Institute for Natural Language Processing, University of Stuttgart, Pfaffenwaldring 5b, 70569, Stuttgart, Germany
97 schema:name Institute for Natural Language Processing, University of Stuttgart, Pfaffenwaldring 5b, 70569, Stuttgart, Germany
98 rdf:type schema:Organization
99 grid-institutes:grid.9008.1 schema:alternateName Department of Foundations of Computer Science, University of Szeged, Árpád tér 2, H-6720, Szeged, Hungary
100 schema:name Department of Foundations of Computer Science, University of Szeged, Árpád tér 2, H-6720, Szeged, Hungary
101 rdf:type schema:Organization
 




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


...