Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > PALASH SARKAR:
All reports by Author Palash Sarkar:

TR01-081 | 8th August 2001
Palash Sarkar

Pushdown Automaton with the Ability to Flip its Stack

We introduce the idea of pushdown automata with the ability to flip
its stack. By bounding the number of times the stack can be flipped
we obtain a hierarchy of language classes from the context free
languages to the recursively enumerable languages. We show that each
class in ... more >>>




ISSN 1433-8092 | Imprint