Preeti Malakar, Thomas George, et al.
SC 2012
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.
Preeti Malakar, Thomas George, et al.
SC 2012
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Raymond Wu, Jie Lu
ITA Conference 2007