Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Beauquier, J.: Deux familles de langages incomparables. Information and Control 43(2), 101–122 (1979)
2. EATCS Monographs on Theoretical Computer Science;J. Dassow,1989
3. Ehrenfeucht, A., Rozenberg, G.: A pumping theorem for EDT0L languages. Tech. Rep. CU-CS-047-74, University of Colorado (1974)
4. Ehrenfeucht, A., Rozenberg, G.: On proving that certain languages are not ETOL. Acta Informatica 6, 407–415 (1976)
5. Ewert, S., van der Walt, A.: A pumping lemma for random permitting context languages. Theoretical Computer Science 270(1-2), 959–967 (2002)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献