Site-directed insertion: Decision problems, maximality and minimality

Da Jung Cho, Yo Sub Han, Kai Salomaa, Taylor J. Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Site-directed insertion is an overlapping insertion operation that can be viewed as analogous to the overlap assembly or chop operations that concatenate strings by overlapping a suffix and a prefix of the argument strings. We consider decision problems and language equations involving site-directed insertion. By relying on the tools provided by semantic shuffle on trajectories we show that one variable equations involving site-directed insertion and regular constants can be solved. We consider also maximal and minimal variants of the site-directed insertion operation.

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings
EditorsStavros Konstantinidis, Giovanni Pighizzini
PublisherSpringer Verlag
Pages49-61
Number of pages13
ISBN (Print)9783319946306
DOIs
Publication statusPublished - 2018 Jan 1
Event20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2018 - Halifax, Canada
Duration: 2018 Jul 252018 Jul 27

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10952 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2018
CountryCanada
CityHalifax
Period18/7/2518/7/27

Fingerprint

Minimality
Decision problem
Insertion
Semantics
Trajectories
Overlapping
Strings
Suffix
Shuffle
Prefix
Overlap
Trajectory

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cho, D. J., Han, Y. S., Salomaa, K., & Smith, T. J. (2018). Site-directed insertion: Decision problems, maximality and minimality. In S. Konstantinidis, & G. Pighizzini (Eds.), Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings (pp. 49-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10952 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-94631-3_5
Cho, Da Jung ; Han, Yo Sub ; Salomaa, Kai ; Smith, Taylor J. / Site-directed insertion : Decision problems, maximality and minimality. Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. editor / Stavros Konstantinidis ; Giovanni Pighizzini. Springer Verlag, 2018. pp. 49-61 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3316a3c99930405cbac31bb3cf4708af,
title = "Site-directed insertion: Decision problems, maximality and minimality",
abstract = "Site-directed insertion is an overlapping insertion operation that can be viewed as analogous to the overlap assembly or chop operations that concatenate strings by overlapping a suffix and a prefix of the argument strings. We consider decision problems and language equations involving site-directed insertion. By relying on the tools provided by semantic shuffle on trajectories we show that one variable equations involving site-directed insertion and regular constants can be solved. We consider also maximal and minimal variants of the site-directed insertion operation.",
author = "Cho, {Da Jung} and Han, {Yo Sub} and Kai Salomaa and Smith, {Taylor J.}",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-94631-3_5",
language = "English",
isbn = "9783319946306",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "49--61",
editor = "Stavros Konstantinidis and Giovanni Pighizzini",
booktitle = "Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings",
address = "Germany",

}

Cho, DJ, Han, YS, Salomaa, K & Smith, TJ 2018, Site-directed insertion: Decision problems, maximality and minimality. in S Konstantinidis & G Pighizzini (eds), Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10952 LNCS, Springer Verlag, pp. 49-61, 20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, Halifax, Canada, 18/7/25. https://doi.org/10.1007/978-3-319-94631-3_5

Site-directed insertion : Decision problems, maximality and minimality. / Cho, Da Jung; Han, Yo Sub; Salomaa, Kai; Smith, Taylor J.

Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. ed. / Stavros Konstantinidis; Giovanni Pighizzini. Springer Verlag, 2018. p. 49-61 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10952 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Site-directed insertion

T2 - Decision problems, maximality and minimality

AU - Cho, Da Jung

AU - Han, Yo Sub

AU - Salomaa, Kai

AU - Smith, Taylor J.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Site-directed insertion is an overlapping insertion operation that can be viewed as analogous to the overlap assembly or chop operations that concatenate strings by overlapping a suffix and a prefix of the argument strings. We consider decision problems and language equations involving site-directed insertion. By relying on the tools provided by semantic shuffle on trajectories we show that one variable equations involving site-directed insertion and regular constants can be solved. We consider also maximal and minimal variants of the site-directed insertion operation.

AB - Site-directed insertion is an overlapping insertion operation that can be viewed as analogous to the overlap assembly or chop operations that concatenate strings by overlapping a suffix and a prefix of the argument strings. We consider decision problems and language equations involving site-directed insertion. By relying on the tools provided by semantic shuffle on trajectories we show that one variable equations involving site-directed insertion and regular constants can be solved. We consider also maximal and minimal variants of the site-directed insertion operation.

UR - http://www.scopus.com/inward/record.url?scp=85050643476&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050643476&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-94631-3_5

DO - 10.1007/978-3-319-94631-3_5

M3 - Conference contribution

AN - SCOPUS:85050643476

SN - 9783319946306

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 49

EP - 61

BT - Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings

A2 - Konstantinidis, Stavros

A2 - Pighizzini, Giovanni

PB - Springer Verlag

ER -

Cho DJ, Han YS, Salomaa K, Smith TJ. Site-directed insertion: Decision problems, maximality and minimality. In Konstantinidis S, Pighizzini G, editors, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Springer Verlag. 2018. p. 49-61. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-94631-3_5