Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata

—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time. Keywords-Symmetric Computation, Auxiliary Pushdown Automata, LogCFL, Reversible Computation

• Type: Conference
• Year: 2010
• Where: COCO
• Authors: Eric Allender, Klaus-Jörn Lange
• Keywords: Algorithms, Auxiliary Pushdown Automaton, COCO 2010, Nondeterministic Auxiliary Pushdown, Symmetric Auxiliary Pushdown