Descriptional and Computational Complexity of the Circuit Representation of Finite Automata

Maris Valdats. Descriptional and Computational Complexity of the Circuit Representation of Finite Automata. In Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira, editors, Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings. Volume 10792 of Lecture Notes in Computer Science, pages 105-117, Springer, 2018. [doi]

Abstract

Abstract is missing.