Site-Directed Insertion: Decision Problems, Maximality and Minimality - Laboratoire Méthodes Formelles Access content directly
Conference Papers Year : 2018

Site-Directed Insertion: Decision Problems, Maximality and Minimality

Yo-Sub Han
  • Function : Author
  • PersonId : 1024595
Kai Salomaa
  • Function : Author
  • PersonId : 1022715
Taylor J. Smith
  • Function : Author
  • PersonId : 1038038

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.
Fichier principal
Vignette du fichier
main.pdf (376.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01937654 , version 1 (28-11-2018)

Identifiers

  • HAL Id : hal-01937654 , version 1

Cite

Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith. Site-Directed Insertion: Decision Problems, Maximality and Minimality. 20th International Conference on Descriptional Complexity of Formal Systems, Jul 2018, Halifax, Canada. ⟨hal-01937654⟩
27 View
73 Download

Share

Gmail Facebook X LinkedIn More