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
Oliver Bodemer
IBM J. Res. Dev
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007