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.
|Title of host publication||Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings|
|Editors||Stavros Konstantinidis, Giovanni Pighizzini|
|Number of pages||13|
|Publication status||Published - 2018|
|Event||20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2018 - Halifax, Canada|
Duration: 2018 Jul 25 → 2018 Jul 27
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2018|
|Period||18/7/25 → 18/7/27|
Bibliographical noteFunding Information:
Cho and Han were supported by the Basic Science Research Program through NRF (2015R1D1A1A01060097) and the International Research & Development Program of NRF (2017K1A3A1A12024971). Salomaa and Smith were supported by Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)