On path-controlled insertion–deletion systems View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2019-02

AUTHORS

Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman

ABSTRACT

A graph-controlled insertion–deletion system is a regulated extension of an insertion–deletion system. It has several components and each component contains some insertion–deletion rules. These components are the vertices of a directed control graph. A transition is performed by any applicable rule in the current component on a string and the resultant string is then moved to the target component specified in the rule. This also describes the arcs of the control graph. Starting from an axiom in the initial component, strings thus move through the control graph. The language of the system is the set of all terminal strings collected in the final component. In this paper, we investigate a variant of the main question in this area: which combinations of size parameters (the maximum number of components, the maximal length of the insertion string, the maximal length of the left context for insertion, the maximal length of the right context for insertion; plus three similar restrictions with respect to deletion) are sufficient to maintain computational completeness of such restricted systems under the additional restriction that the (undirected) control graph is a path? Notice that these results also bear consequences for the domain of insertion–deletion P systems, improving on a number of previous results from the literature, concerning in particular the number of components (membranes) that are necessary for computational completeness results. More... »

PAGES

1-25

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00236-018-0312-2

DOI

http://dx.doi.org/10.1007/s00236-018-0312-2

DIMENSIONS

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


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/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Trier", 
          "id": "https://www.grid.ac/institutes/grid.12391.38", 
          "name": [
            "Fachbereich 4 \u2013 Abteilung Informatikwissenschaften, CIRT, Universit\u00e4t Trier, 54286, Trier, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fernau", 
        "givenName": "Henning", 
        "id": "sg:person.010720205113.54", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010720205113.54"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Vellore Institute of Technology University", 
          "id": "https://www.grid.ac/institutes/grid.412813.d", 
          "name": [
            "School of Computer Science and Engineering, VIT University, 632 014, Vellore, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kuppusamy", 
        "givenName": "Lakshmanan", 
        "id": "sg:person.012556333775.56", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012556333775.56"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Vellore Institute of Technology University", 
          "id": "https://www.grid.ac/institutes/grid.412813.d", 
          "name": [
            "School of Information Technology and Engineering, VIT University, 632 014, Vellore, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Raman", 
        "givenName": "Indhumathi", 
        "id": "sg:person.012211704523.50", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012211704523.50"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/j.tcs.2012.07.002", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000370622"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s11047-010-9208-y", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000492997", 
          "https://doi.org/10.1007/s11047-010-9208-y"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1006/inco.1996.0091", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1006209139"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-88282-4_31", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009825177", 
          "https://doi.org/10.1007/978-3-540-88282-4_31"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-88282-4_31", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009825177", 
          "https://doi.org/10.1007/978-3-540-88282-4_31"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-19056-8_23", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012777312", 
          "https://doi.org/10.1007/978-3-642-19056-8_23"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-19056-8_23", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012777312", 
          "https://doi.org/10.1007/978-3-642-19056-8_23"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-56196-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013689060", 
          "https://doi.org/10.1007/978-3-642-56196-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-56196-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013689060", 
          "https://doi.org/10.1007/978-3-642-56196-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-74593-8_18", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014817648", 
          "https://doi.org/10.1007/978-3-540-74593-8_18"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-74593-8_18", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014817648", 
          "https://doi.org/10.1007/978-3-540-74593-8_18"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.tcs.2004.06.031", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016249201"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-94-015-8969-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018210433", 
          "https://doi.org/10.1007/978-94-015-8969-7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-94-015-8969-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018210433", 
          "https://doi.org/10.1007/978-94-015-8969-7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-54239-8_16", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018661688", 
          "https://doi.org/10.1007/978-3-642-54239-8_16"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.tcs.2007.07.030", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030219977"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/b:naco.0000006769.27984.23", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031818152", 
          "https://doi.org/10.1023/b:naco.0000006769.27984.23"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0020-0255(83)90023-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034311295"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0020-0255(83)90023-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034311295"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1044956201", 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-662-03563-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044956201", 
          "https://doi.org/10.1007/978-3-662-03563-4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-662-03563-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044956201", 
          "https://doi.org/10.1007/978-3-662-03563-4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-48017-x_34", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046674838", 
          "https://doi.org/10.1007/3-540-48017-x_34"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.tcs.2010.08.025", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048087294"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.4204/eptcs.31.11", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1072356203"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.4204/eptcs.31.11", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1072356203"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.tcs.2017.01.019", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1083421829"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1051/ita/1991250504731", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1083550379"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-319-55911-7_15", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1085587776", 
          "https://doi.org/10.1007/978-3-319-55911-7_15"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-319-60134-2_8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086390621", 
          "https://doi.org/10.1007/978-3-319-60134-2_8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-319-60252-3_10", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1089971355", 
          "https://doi.org/10.1007/978-3-319-60252-3_10"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s11047-017-9656-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1099696265", 
          "https://doi.org/10.1007/s11047-017-9656-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1109710753", 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-74932-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1109710753", 
          "https://doi.org/10.1007/978-3-642-74932-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-74932-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1109710753", 
          "https://doi.org/10.1007/978-3-642-74932-2"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2019-02", 
    "datePublishedReg": "2019-02-01", 
    "description": "A graph-controlled insertion\u2013deletion system is a regulated extension of an insertion\u2013deletion system. It has several components and each component contains some insertion\u2013deletion rules. These components are the vertices of a directed control graph. A transition is performed by any applicable rule in the current component on a string and the resultant string is then moved to the target component specified in the rule. This also describes the arcs of the control graph. Starting from an axiom in the initial component, strings thus move through the control graph. The language of the system is the set of all terminal strings collected in the final component. In this paper, we investigate a variant of the main question in this area: which combinations of size parameters (the maximum number of components, the maximal length of the insertion string, the maximal length of the left context for insertion, the maximal length of the right context for insertion; plus three similar restrictions with respect to deletion) are sufficient to maintain computational completeness of such restricted systems under the additional restriction that the (undirected) control graph is a path? Notice that these results also bear consequences for the domain of insertion\u2013deletion P systems, improving on a number of previous results from the literature, concerning in particular the number of components (membranes) that are necessary for computational completeness results.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00236-018-0312-2", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1133515", 
        "issn": [
          "0001-5903", 
          "1432-0525"
        ], 
        "name": "Acta Informatica", 
        "type": "Periodical"
      }
    ], 
    "name": "On path-controlled insertion\u2013deletion systems", 
    "pagination": "1-25", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "77f4b3c870247fe8b71db267f338f0a1904da583a03fc8ba475b74ffefe3d720"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00236-018-0312-2"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1100831495"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00236-018-0312-2", 
      "https://app.dimensions.ai/details/publication/pub.1100831495"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T16:05", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8664_00000603.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/s00236-018-0312-2"
  }
]
 

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/s00236-018-0312-2'

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/s00236-018-0312-2'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00236-018-0312-2'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00236-018-0312-2'


 

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

164 TRIPLES      21 PREDICATES      51 URIs      17 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00236-018-0312-2 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author Nc8cd9d75fc9e4074b670817dbfdf6c18
4 schema:citation sg:pub.10.1007/3-540-48017-x_34
5 sg:pub.10.1007/978-3-319-55911-7_15
6 sg:pub.10.1007/978-3-319-60134-2_8
7 sg:pub.10.1007/978-3-319-60252-3_10
8 sg:pub.10.1007/978-3-540-74593-8_18
9 sg:pub.10.1007/978-3-540-88282-4_31
10 sg:pub.10.1007/978-3-642-19056-8_23
11 sg:pub.10.1007/978-3-642-54239-8_16
12 sg:pub.10.1007/978-3-642-56196-2
13 sg:pub.10.1007/978-3-642-74932-2
14 sg:pub.10.1007/978-3-662-03563-4
15 sg:pub.10.1007/978-94-015-8969-7
16 sg:pub.10.1007/s11047-010-9208-y
17 sg:pub.10.1007/s11047-017-9656-8
18 sg:pub.10.1023/b:naco.0000006769.27984.23
19 https://app.dimensions.ai/details/publication/pub.1044956201
20 https://app.dimensions.ai/details/publication/pub.1109710753
21 https://doi.org/10.1006/inco.1996.0091
22 https://doi.org/10.1016/0020-0255(83)90023-3
23 https://doi.org/10.1016/j.tcs.2004.06.031
24 https://doi.org/10.1016/j.tcs.2007.07.030
25 https://doi.org/10.1016/j.tcs.2010.08.025
26 https://doi.org/10.1016/j.tcs.2012.07.002
27 https://doi.org/10.1016/j.tcs.2017.01.019
28 https://doi.org/10.1051/ita/1991250504731
29 https://doi.org/10.4204/eptcs.31.11
30 schema:datePublished 2019-02
31 schema:datePublishedReg 2019-02-01
32 schema:description A graph-controlled insertion–deletion system is a regulated extension of an insertion–deletion system. It has several components and each component contains some insertion–deletion rules. These components are the vertices of a directed control graph. A transition is performed by any applicable rule in the current component on a string and the resultant string is then moved to the target component specified in the rule. This also describes the arcs of the control graph. Starting from an axiom in the initial component, strings thus move through the control graph. The language of the system is the set of all terminal strings collected in the final component. In this paper, we investigate a variant of the main question in this area: which combinations of size parameters (the maximum number of components, the maximal length of the insertion string, the maximal length of the left context for insertion, the maximal length of the right context for insertion; plus three similar restrictions with respect to deletion) are sufficient to maintain computational completeness of such restricted systems under the additional restriction that the (undirected) control graph is a path? Notice that these results also bear consequences for the domain of insertion–deletion P systems, improving on a number of previous results from the literature, concerning in particular the number of components (membranes) that are necessary for computational completeness results.
33 schema:genre research_article
34 schema:inLanguage en
35 schema:isAccessibleForFree false
36 schema:isPartOf sg:journal.1133515
37 schema:name On path-controlled insertion–deletion systems
38 schema:pagination 1-25
39 schema:productId N25235c813afa4f9fb52880aa639c16ef
40 N426980b396914152991a14dae1328dd1
41 Nfcb41c8ccf574d0b9fc06ccb18a74be2
42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1100831495
43 https://doi.org/10.1007/s00236-018-0312-2
44 schema:sdDatePublished 2019-04-10T16:05
45 schema:sdLicense https://scigraph.springernature.com/explorer/license/
46 schema:sdPublisher N4866720bd6004ce89026fa9fd7f74a40
47 schema:url http://link.springer.com/10.1007/s00236-018-0312-2
48 sgo:license sg:explorer/license/
49 sgo:sdDataset articles
50 rdf:type schema:ScholarlyArticle
51 N25235c813afa4f9fb52880aa639c16ef schema:name doi
52 schema:value 10.1007/s00236-018-0312-2
53 rdf:type schema:PropertyValue
54 N3c2fcb356ee74fd1b4d6b978ed1266e2 rdf:first sg:person.012556333775.56
55 rdf:rest N42a24166efd84d58a0f4dec07b08aad7
56 N426980b396914152991a14dae1328dd1 schema:name dimensions_id
57 schema:value pub.1100831495
58 rdf:type schema:PropertyValue
59 N42a24166efd84d58a0f4dec07b08aad7 rdf:first sg:person.012211704523.50
60 rdf:rest rdf:nil
61 N4866720bd6004ce89026fa9fd7f74a40 schema:name Springer Nature - SN SciGraph project
62 rdf:type schema:Organization
63 Nc8cd9d75fc9e4074b670817dbfdf6c18 rdf:first sg:person.010720205113.54
64 rdf:rest N3c2fcb356ee74fd1b4d6b978ed1266e2
65 Nfcb41c8ccf574d0b9fc06ccb18a74be2 schema:name readcube_id
66 schema:value 77f4b3c870247fe8b71db267f338f0a1904da583a03fc8ba475b74ffefe3d720
67 rdf:type schema:PropertyValue
68 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
69 schema:name Mathematical Sciences
70 rdf:type schema:DefinedTerm
71 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
72 schema:name Pure Mathematics
73 rdf:type schema:DefinedTerm
74 sg:journal.1133515 schema:issn 0001-5903
75 1432-0525
76 schema:name Acta Informatica
77 rdf:type schema:Periodical
78 sg:person.010720205113.54 schema:affiliation https://www.grid.ac/institutes/grid.12391.38
79 schema:familyName Fernau
80 schema:givenName Henning
81 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010720205113.54
82 rdf:type schema:Person
83 sg:person.012211704523.50 schema:affiliation https://www.grid.ac/institutes/grid.412813.d
84 schema:familyName Raman
85 schema:givenName Indhumathi
86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012211704523.50
87 rdf:type schema:Person
88 sg:person.012556333775.56 schema:affiliation https://www.grid.ac/institutes/grid.412813.d
89 schema:familyName Kuppusamy
90 schema:givenName Lakshmanan
91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012556333775.56
92 rdf:type schema:Person
93 sg:pub.10.1007/3-540-48017-x_34 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046674838
94 https://doi.org/10.1007/3-540-48017-x_34
95 rdf:type schema:CreativeWork
96 sg:pub.10.1007/978-3-319-55911-7_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1085587776
97 https://doi.org/10.1007/978-3-319-55911-7_15
98 rdf:type schema:CreativeWork
99 sg:pub.10.1007/978-3-319-60134-2_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086390621
100 https://doi.org/10.1007/978-3-319-60134-2_8
101 rdf:type schema:CreativeWork
102 sg:pub.10.1007/978-3-319-60252-3_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1089971355
103 https://doi.org/10.1007/978-3-319-60252-3_10
104 rdf:type schema:CreativeWork
105 sg:pub.10.1007/978-3-540-74593-8_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014817648
106 https://doi.org/10.1007/978-3-540-74593-8_18
107 rdf:type schema:CreativeWork
108 sg:pub.10.1007/978-3-540-88282-4_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009825177
109 https://doi.org/10.1007/978-3-540-88282-4_31
110 rdf:type schema:CreativeWork
111 sg:pub.10.1007/978-3-642-19056-8_23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012777312
112 https://doi.org/10.1007/978-3-642-19056-8_23
113 rdf:type schema:CreativeWork
114 sg:pub.10.1007/978-3-642-54239-8_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018661688
115 https://doi.org/10.1007/978-3-642-54239-8_16
116 rdf:type schema:CreativeWork
117 sg:pub.10.1007/978-3-642-56196-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013689060
118 https://doi.org/10.1007/978-3-642-56196-2
119 rdf:type schema:CreativeWork
120 sg:pub.10.1007/978-3-642-74932-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1109710753
121 https://doi.org/10.1007/978-3-642-74932-2
122 rdf:type schema:CreativeWork
123 sg:pub.10.1007/978-3-662-03563-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044956201
124 https://doi.org/10.1007/978-3-662-03563-4
125 rdf:type schema:CreativeWork
126 sg:pub.10.1007/978-94-015-8969-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018210433
127 https://doi.org/10.1007/978-94-015-8969-7
128 rdf:type schema:CreativeWork
129 sg:pub.10.1007/s11047-010-9208-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1000492997
130 https://doi.org/10.1007/s11047-010-9208-y
131 rdf:type schema:CreativeWork
132 sg:pub.10.1007/s11047-017-9656-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1099696265
133 https://doi.org/10.1007/s11047-017-9656-8
134 rdf:type schema:CreativeWork
135 sg:pub.10.1023/b:naco.0000006769.27984.23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031818152
136 https://doi.org/10.1023/b:naco.0000006769.27984.23
137 rdf:type schema:CreativeWork
138 https://app.dimensions.ai/details/publication/pub.1044956201 schema:CreativeWork
139 https://app.dimensions.ai/details/publication/pub.1109710753 schema:CreativeWork
140 https://doi.org/10.1006/inco.1996.0091 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006209139
141 rdf:type schema:CreativeWork
142 https://doi.org/10.1016/0020-0255(83)90023-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034311295
143 rdf:type schema:CreativeWork
144 https://doi.org/10.1016/j.tcs.2004.06.031 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016249201
145 rdf:type schema:CreativeWork
146 https://doi.org/10.1016/j.tcs.2007.07.030 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030219977
147 rdf:type schema:CreativeWork
148 https://doi.org/10.1016/j.tcs.2010.08.025 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048087294
149 rdf:type schema:CreativeWork
150 https://doi.org/10.1016/j.tcs.2012.07.002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000370622
151 rdf:type schema:CreativeWork
152 https://doi.org/10.1016/j.tcs.2017.01.019 schema:sameAs https://app.dimensions.ai/details/publication/pub.1083421829
153 rdf:type schema:CreativeWork
154 https://doi.org/10.1051/ita/1991250504731 schema:sameAs https://app.dimensions.ai/details/publication/pub.1083550379
155 rdf:type schema:CreativeWork
156 https://doi.org/10.4204/eptcs.31.11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1072356203
157 rdf:type schema:CreativeWork
158 https://www.grid.ac/institutes/grid.12391.38 schema:alternateName University of Trier
159 schema:name Fachbereich 4 – Abteilung Informatikwissenschaften, CIRT, Universität Trier, 54286, Trier, Germany
160 rdf:type schema:Organization
161 https://www.grid.ac/institutes/grid.412813.d schema:alternateName Vellore Institute of Technology University
162 schema:name School of Computer Science and Engineering, VIT University, 632 014, Vellore, India
163 School of Information Technology and Engineering, VIT University, 632 014, Vellore, India
164 rdf:type schema:Organization
 




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


...