Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Ďuriš, P., Košta, M.: Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. Inform. Process. Lett. 114, 417–420 (2014)
2. Lecture Notes in Computer Science;M. Holzer,2003
3. Lecture Notes in Computer Science;M. Holzer,2003
4. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)
5. Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comput. Sci. 197, 1–56 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A pumping lemma for flip-pushdown languages;RAIRO - Theoretical Informatics and Applications;2016-06-02