Klaus Reinhardt
Wilhelm-Schickard Institut für Informatik
Universität Tübingen
Sand 13, D-72076 Tübingen, Germany
e-mail: reinhard@informatik.uni-tuebingen.de
Eric Allender
Department of Computer Science, Rutgers University
P.O. Box 1179, Piscataway, NJ 08855-1179,USA
e-mail: allender@cs.rutgers.edu
We show that in the context of nonuniform complexity, nondeterministic
logarithmic space bounded computation can be made unambiguous. An
analogous result holds for the class of problems reducible to
context-free languages. In terms of complexity classes, this
can be stated as:
NL/poly = UL/poly
LogCFL/poly = UAuxPDA( 
)/poly