Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
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
Leo Liberti, James Ostrowski
Journal of Global Optimization
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering