Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
We show that the nonemptiness problem for two-way automata with only one endmarker over unary alphabets is complete for nondeterministic logarithmic space. This should be contrasted with the corresponding problem for two-way automata with two endmarkers, which is known to be NP-complete. © 1990.
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Eric Price, David P. Woodruff
FOCS 2011
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001