On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. - Andris Ambainis; Arnolds Kikusts; Maris Valdats (STACS, 2001)

Boolean Circuit Complexity of Regular Languages. - Maris Valdats (AFL, 2014)

Descriptional and Computational Complexity of the Circuit Representation of Finite Automata. - Maris Valdats (LATA, 2018)

Transition Function Complexity of Finite Automata. - Maris Valdats (Balt. J. Mod. Comput., 2019)