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]
@inproceedings{BlondinM12, title = {The Complexity of Intersecting Finite Automata Having Few Final States}, author = {Michael Blondin and Pierre McKenzie}, year = {2012}, doi = {10.1007/978-3-642-30642-6_4}, url = {http://dx.doi.org/10.1007/978-3-642-30642-6_4}, researchr = {https://researchr.org/publication/BlondinM12}, cites = {0}, citedby = {0}, pages = {31-42}, booktitle = {Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings}, editor = {Edward A. Hirsch and Juhani Karhumäki and Arto Lepistö and Michail Prilutskii}, volume = {7353}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-30641-9}, }