Site-Directed Insertion: Decision Problems, Maximality and Minimality

@inproceedings{Cho2018SiteDirectedID,
  title={Site-Directed Insertion: Decision Problems, Maximality and Minimality},
  author={Da-Jung Cho and Yo-Sub Han and Kai Salomaa and Taylor J. Smith},
  booktitle={DCFS},
  year={2018}
}
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… 
View PDF on arXiv
4 Citations

4 Citations

Citation Type

Citation Type

Site-directed insertion: Language equations and decision problems
Theoretical and Implementational Aspects of the Formal Language Server (LaSer)
TLDR
This work presents some theoretical and implementational aspects of LaSer, the formal language server, as well as some ongoing progress and research plans.
Operation Insertion on the Conjugacy and Commutativity of Words
TLDR
The classical notions of conjugacy and commutativity of words are generalized to insertion-conjugacy and insertion-commutativity in combinatorics of words.
Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings
TLDR
Read Mapping Through Hardware/Software Co-design Through hardware/ software co-design is explored through hardware-based and software-based approaches.

References

SHOWING 1-10 OF 24 REFERENCES
Outfix-guided insertion
Contextual Insertions/Deletions and Computability
TLDR
It is proved that every Turing machine can be simulated by a system based entirely on contextual insertions and deletions and decidability of existence of solutions to equations involving these operations.
Descriptional Complexity of Chop Operations on Unary and Finite Languages
TLDR
It is shown that any chop expression, describing a unary language, can be converted into an equivalent regular expression of linear size, which nicely contrasts the general case.
Semantic Shuffle on and Deletion Along Trajectories
TLDR
These operations generalize the notion of shuffle on trajectories, but add sufficient power to encompass various formal language operations used in applied areas, especially with respect to solving language equations involving SST.
On the overlap assembly of strings and languages
TLDR
This paper investigates properties of the binary string and language operation overlap assembly, defined by Csuhaj-Varjú, Petre and Vaszil as a formal model of the linear self-assembly of DNA strands, and the possible use of iterated overlap assembly to generate combinatorial DNA libraries.
State Complexity of Insertion
TLDR
This work considers the state complexity of insertion in the case where the inserted language is bifix-free or non-returning and presents the tight nondeterministic state complexity by a fooling set technique.
Shuffle on Trajectories: Syntactic Constraints
The chop of languages
On Language Equations with Invertible Operations
  • L. Kari
  • Mathematics
    Theor. Comput. Sci.
  • 1994
Interpreted Trajectories
TLDR
It is shown that the generalized operations can simulate Turing machine computations and a notion of unambiguity that is sufficient to make equivalence decidable for regular sets of trajectories under nonincreasing interpretations is considered.
...
1
2
3
...