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

3 Citations (Scopus)


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
Number of pages13
ISBN (Print)9783319946306
Publication statusPublished - 2018
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


Other20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2018

Bibliographical note

Publisher Copyright:
© IFIP International Federation for Information Processing 2018.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Site-directed insertion: Decision problems, maximality and minimality'. Together they form a unique fingerprint.

Cite this