Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
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
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)