Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR11-034 | 20th January 2011 10:16

Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable

RSS-Feed




TR11-034
Authors: Pavol Duris, Marek Kosta
Publication: 14th March 2011 01:09
Downloads: 1472
Keywords: 


Abstract:

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].



ISSN 1433-8092 | Imprint