Bowen Zhou, Bing Xiang, et al.
SSST 2008
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
Conference paper
Association control in mobile wireless networks
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
G. Ramalingam
Theoretical Computer Science