- 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.
- Production Complexity of Some Operations on Context-Free LanguagesJürgen Dassow; Ronny HarbichDescriptional Complexity of Formal Systems, Springer Berlin Heidelberg, 141-154, 2012.
- Deciding Whether a Regular Language Is Generated by a Splicing SystemLila Kari; Steffen KopeckiLecture Notes in Computer Science, Springer Berlin Heidelberg, 98-109, 2012.
书籍章节
The State Complexity of Star-Complement-Star
12阅读
