外固定器引导插入
Outfix-guided insertion
摘要：
受DNA字符串上生物操作工作的启发，我们考虑了一个外接引导的插入操作，它可以被看作是以前研究的字符串上的重叠组装操作的推广。作为主要结果，我们构造了一个有限语言$L$，使得$L$的外接引导插入闭包是非正则的。我们还考虑了正则和（确定性）上下文无关语言的闭包属性下的后缀引导插入操作和决策问题有关的后缀引导插入。确定性有限自动机识别的语言在后缀引导插入下是否是封闭的可以在多项式时间内完成。非确定性有限自动机的相应问题的复杂性仍然是开放的。
英文摘要：
Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language $L$ such that the outfix-guided insertion closure of $L$ is non-regular. We consider also the closure properties of regular and (deterministic) context-free languages under the outfix-guided insertion operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time. The complexity of the corresponding question for nondeterministic finite automata remains open.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
