György E. Révész
Theoretical Computer Science
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.
György E. Révész
Theoretical Computer Science
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Nanda Kambhatla
ACL 2004
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003