Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
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
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010