Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
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.
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000