1. A note on sweeping automata;Berman,1980
2. P. Berman, A. Lingas, On the complexity of regular languages in terms of finite automata, Tech. Rep. 304, Polish Academy of Sciences, 1977.
3. Two-way automaton computations;Birget;Theoret. Inform. Appl.,1990
4. Finite automata and unary languages;Chrobak;Theoret. Comput. Sci.,1986
5. Nondeterministic computations in sublogarithmic space and space constructibility;Geffert;SIAM J. Comput.,1991