文章基本信息

标题：Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
本地全文：下载
作者：Eric Allender ; Klaus-Joern Lange
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2010
卷号：2010
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = LogCFL) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time.
关键词：AuxPDAs, LogCFL, Reversible Computation, Symmetric Computation