| | |
Summary: Symmetry Coincides with Nondeterminism for
Time-Bounded Auxiliary Pushdown Automata1
Eric Allender
Department of Computer Science
Rutgers University
New Brunswick, NJ 08855, USA
Email: allender@cs.rutgers.edu
Klaus-J¨orn Lange
Wilhelm-Schickard Institut f¨ur Informatik
Universit¨at T¨ubingen
D-72076 T¨ubingen, Germany
Email: lange@informatik.uni-tuebingen.de
Abstract--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 Au-
tomata, LogCFL, Reversible Computation
|
