- Weighted Splicing SystemsS. Turaev; Y. S. Gan; M. Othman; N. H. Sarmin; W. H. FongCommunications in Computer and Information Science, Springer Berlin Heidelberg, 416-424, 2012.
- Production Complexity of Some Operations on Context-Free LanguagesJürgen Dassow; Ronny HarbichDescriptional Complexity of Formal Systems, Springer Berlin Heidelberg, 141-154, 2012.
- An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) WordsMichelangelo, Cianciulli; Rocco, Zaccagnino; Rosalba, ZizzaTheory and Practice of Natural Computing, Springer Berlin Heidelberg, 121-132, 2012.
书籍章节
Deciding Whether a Regular Language Is Generated by a Splicing System
10阅读
