Author:
Min Yong,Jin Ziao-gang,Su Xian-chuang,Peng Bo
Publisher
Zhejiang University Press
Reference7 articles.
1. Ehrenfeucht, A., Pâun, G., Rozenberg, G., 1998. On representing RE languages by internal contextual languages.Theoretical Computer Science,205(1–2):61–83.
2. Kari, L., Thierrin, G., 1996. Contextual insertion/deletion and computability.Information and Computation,131(1): 47–61.
3. Kari, L., Pâun, G., Thierrin, G., Yu, S., 1997. At the Cross-roads of DNA Computing and Formal Languages: Characterizing RE using Insertion-Deletion Systems. Proceedings of 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, p.318–333.
4. Margenstern, M., Pâun, G., Rogozhin, Y., Verlan, S., 2005. Context-free insertion-deletion systems.Theoretical Computer Science,330(2):339–348.
5. Martin-Vide, C., Pâun, G., Salomaa, A., 1998. Characterizations of recursively enumerable language by means of insertion grammars.Theoretical Computer Science,205(1–2):195–205.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献