Universal insertion grammars of size two.
THEORETICAL COMPUTER SCIENCE(2020)
摘要
In this paper, we show that pure insertion grammars of size 2(i.e., inserting two symbols in a left and right context, each consisting of two symbols) can characterize all recursively enumerable languages. This is achieved by either applying an inverse morphism and a weak coding, or a left (right) quotient with a regular LOC(2) language, or an intersection with a LOC(2) language and a weak coding. The obtained results improve the descriptional complexity of insertion grammars and complete the picture of known results on insertion-deletion systems that are motivated from the DNA computing area. (c) 2020 Elsevier B.V. All rights reserved.
更多查看译文
关键词
Insertion grammars,Insertion systems,Recursively enumerable sets,Homomorphic representation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络