Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
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
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Fan Zhang, Junwei Cao, et al.
IEEE TETC