Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete
Mohamed Faouzi Atig
Int. J. Found. Comput. Sci.
Abstract & Figures
Sorry, we couldn't extract an abstract for this paper.
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.
Sorry, we couldn't extract any citations for this paper.
Sorry, we couldn't extract any references for this paper.
Loading similar papers…
Slides referencing similar topics
Recitation: Equivalence of PDAs Accepting by Final State / Empty Stack
Sep 27, 2017
A Context-Free Process as a Pushdown Automaton
Paul van Tilburg + 2 • Mar 21, 2015
Input-Driven Stack Automata
Suna Bensch + 3 • Jan 07, 2016