Conference paper
Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
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
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems