- On the Number of Nonterminal Symbols in Unambiguous Conjunctive GrammarsArtur Jeż; Alexander OkhotinDescriptional Complexity of Formal Systems, Springer Berlin Heidelberg, 183-195, 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-StarGalina Jirásková; Jeffrey ShallitDevelopments in Language Theory, Springer Berlin Heidelberg, 380-391, 2012.
书籍章节
Production Complexity of Some Operations on Context-Free Languages
7阅读
