Elliot Linzer, M. Vetterli
Computing
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.
Elliot Linzer, M. Vetterli
Computing
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
B. Wagle
EJOR