Robert E. Donovan
INTERSPEECH - Eurospeech 2001
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
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Limin Hu
IEEE/ACM Transactions on Networking