William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Paper
Endmarkers can make a difference
Abstract
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.
Related
Conference paper
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Oliver Bodemer
IBM J. Res. Dev
Reena Elangovan, Shubham Jain, et al.
ACM TODAES