Conference paper
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
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
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Thomas M. Cheng
IT Professional