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 language | English |
|---|---|
| Title of host publication | Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings |
| Editors | Stavros Konstantinidis, Giovanni Pighizzini |
| Publisher | Springer Verlag |
| Pages | 49-61 |
| Number of pages | 13 |
| ISBN (Print) | 9783319946306 |
| DOIs | |
| 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 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 10952 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2018 |
|---|---|
| Country/Territory | Canada |
| City | Halifax |
| Period | 18/7/25 → 18/7/27 |
Bibliographical note
Publisher Copyright:© IFIP International Federation for Information Processing 2018.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science