Flip-Pushdown Automata: Nondeterminism is Better than Determinism
- 331 Downloads
Flip-pushdown automata are pushdown automata with the additional ability to flip or reverse its pushdown. We investigate deterministic and nondeterministic flip-pushdown automata accepting by final state or empty pushdown. In particular, for nondeterministic flip-pushdown automata both acceptance criterion are equally powerful, while for determinism, acceptance by empty pushdown is strictly weaker. This nicely fits into the well-known results on ordinary pushdown automata. Moreover, we consider hierarchies of flip-pushdown automata w.r.t. the number of pushdown reversals. There we show that nondeterminism is better than determinism. Moreover, since there are languages which can be recognized by a deterministic flip-pushdown automaton with k + 1 pushdown reversals but which cannot be recognized by a k-flip-pushdown (deterministic or nondeterministic) as shown in  we are able to complete our investigations with incomparability results on different levels of the hierarchies under consideration.
Unable to display preview. Download preview PDF.
- 2.N. Chomsky. Handbook of Mathematic Psychology, volume 2, chapter Formal Properties of Grammars, pages 323–418. Wiley & Sons, New York, 1962.Google Scholar
- 4.R. J. Evey. The Theory and Applications of Pushdown Store Machines. Ph.D thesis, Harvard University, Massachusetts, May 1963.Google Scholar
- 9.M. Holzer and M. Kutrib. Flip-pushdown automata: k +1 pushdown reversals are better than k. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, LNCS, Eindhoven, Netherlands, June–July 2003. Springer. To appear.Google Scholar
- 10.G. Rozenberg and A. Salomaa. The Mathematical Theory of L Systems, volume 90 of Pure and Applied Mathematics. Academic Press, 1980.Google Scholar
- 11.P. Sarkar. Pushdown automaton with the ability to flip its stack. Report TR01-081, Electronic Colloquium on Computational Complexity (ECCC), November 2001.Google Scholar