Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
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
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB