文章基本信息

标题：Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable
本地全文：下载
作者：Pavol Duris, Marek Kosta
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2011
卷号：2011
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We prove that any propagating E0L system cannot generate the language containing all words of the form w#w. This result, together with some known ones, enable us to conclude that the flip-pushdown automata with k pushdown reversals (i.e. the pushdown automata with the ability to flip its pushdown) and E0L systems are incomparable. This result solves an open problem stated in [3].
关键词：Formal languages, E0L systems, pushdown automata