Michael Blondin, Pierre McKenzie. The Complexity of Intersecting Finite Automata Having Few Final States. In Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii, editors, Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Volume 7353 of Lecture Notes in Computer Science, pages 31-42, Springer, 2012. [doi]
Abstract is missing.