Deciding whether a regular language is generated by a splicing system

详细信息    查看全文

• 作者：Lila Kari ; ^{lila@csd.uwo.ca" class="auth_mail" title="E-mail the corresponding author} ; Steffen Kopecki ^{steffen.kopecki@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Splicing systems ; Decidability
• 刊名：Journal of Computer and System Sciences
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：84
• 期：Complete
• 页码：263-287
• 全文大小：1001 K

文摘

(Linear) splicing as a binary word/language operation is inspired by the DNA recombination under the action of restriction enzymes and ligases, and was first introduced by Tom Head in 1987. Shortly thereafter, it was proven that the languages generated by (finite) splicing systems form a proper subclass of the class of regular languages. However, the question of whether or not one can decide if a given regular language is generated by a splicing system remained open. In this paper we give a positive answer to this question. Namely, we prove that, if a language is generated by a splicing system, then it is also generated by a splicing system whose size is a function of the size of the syntactic monoid of the input language, and which can be effectively constructed.