Publisher
Springer Nature Singapore
Reference20 articles.
1. Berman, P., Lingas, A.: On complexity of regular languages in terms of finite automata. Report 304. Institute of Computer Science. Polish Academy of Science, Warsaw (1977)
2. Borodin, A., Cook, S.A., Dymond, P.W., Ruzzo, W.L., Tompa, M.: Two applications of inductive counting for complementation problems. SIAM J. Comput. 18, 559–578 (1989)
3. Geffert, V.: An alternating hierarchy for finite automata. Theor. Comput. Sci. 445, 1–24 (2012)
4. Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Inf. Comput. 205, 1173–1187 (2007)
5. Geffert, V., Pighizzini, G.: Two-way unary automata versus logarithmic space. Inf. Comput. 209, 1016–1025 (2011)