Jean-Éric Pin. How to Prove that a Language Is Regular or Star-Free?. In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, editors, Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings. Volume 12038 of Lecture Notes in Computer Science, pages 68-88, Springer, 2020. [doi]
Abstract is missing.