Site-Directed Insertion: Decision Problems, Maximality and Minimality
Formal Languages and Automata Theory
2018-05-01 v1
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.
Cite
@article{arxiv.1804.11017,
title = {Site-Directed Insertion: Decision Problems, Maximality and Minimality},
author = {Da-Jung Cho and Yo-Sub Han and Kai Salomaa and Taylor J. Smith},
journal= {arXiv preprint arXiv:1804.11017},
year = {2018}
}