Reena Elangovan, Shubham Jain, et al.
ACM TODAES
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.
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
G. Ramalingam
Theoretical Computer Science
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010