Site-directed insertion: Language equations and decision problems

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

Research output: Contribution to journalArticlepeer-review

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 (M. Domaratzki, Developments in Language Theory 2004) we show that one variable equations involving site-directed insertion and regular constants can be solved algorithmically. We consider also maximal and minimal variants of the site-directed insertion operation and the nondeterministic state complexity of site-directed insertion.

Original languageEnglish
Pages (from-to)40-51
Number of pages12
JournalTheoretical Computer Science
Volume798
DOIs
Publication statusPublished - 2019 Dec 17

Bibliographical note

Funding Information:
A preliminary version of this paper [4] was presented at the 20th International Conference Descriptional Complexity of Formal Systems held in Halifax, Canada, July 25–27, 2018. Cho was supported by Labex DigiCosme (ANR-11-LABEX-0045-DIGICOSME) operated by ANR as part of the program “Investissement d'Avenir” Idex Paris-Saclay (ANR-11-IDEX-0003-02), and the CNRS project PEPS DEMO. Han was supported by the Basic Science Research Program (NRF-2018R1D1A1A09084107). Salomaa and Smith were supported by Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.☆ A preliminary version of this paper [4] was presented at the 20th International Conference Descriptional Complexity of Formal Systems held in Halifax, Canada, July 25–27, 2018. Cho was supported by Labex DigiCosme ( ANR-11-LABEX-0045-DIGICOSME) operated by ANR as part of the program “Investissement d'Avenir” Idex Paris-Saclay ( ANR-11-IDEX-0003-02), and the CNRS project PEPS DEMO. Han was supported by the Basic Science Research Program ( NRF- 2018R1D1A1A09084107). Salomaa and Smith were supported by Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.

Funding Information:
A preliminary version of this paper [4] was presented at the 20th International Conference Descriptional Complexity of Formal Systems held in Halifax, Canada, July 25?27, 2018. Cho was supported by Labex DigiCosme (ANR-11-LABEX-0045-DIGICOSME) operated by ANR as part of the program ?Investissement d'Avenir? Idex Paris-Saclay (ANR-11-IDEX-0003-02), and the CNRS project PEPS DEMO. Han was supported by the Basic Science Research Program (NRF-2018R1D1A1A09084107). Salomaa and Smith were supported by Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.

Publisher Copyright:
© 2019 Elsevier B.V.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Site-directed insertion: Language equations and decision problems'. Together they form a unique fingerprint.

Cite this