Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
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
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine