%0 Conference Proceedings
%T Site-Directed Insertion: Decision Problems, Maximality and Minimality
%+ Yonsei University
%+ Queen's University [Kingston, Canada]
%A Cho, Da-Jung
%A Han, Yo-Sub
%A Salomaa, Kai
%A Smith, Taylor, J.
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 20th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Halifax, NS, Canada
%Y Stavros Konstantinidis
%Y Giovanni Pighizzini
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10952
%P 49-61
%8 2018-07-25
%D 2018
%R 10.1007/978-3-319-94631-3_5
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01905635/document
%2 https://inria.hal.science/hal-01905635/file/470153_1_En_5_Chapter.pdf
%L hal-01905635
%U https://inria.hal.science/hal-01905635
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10952