Hermann Gruber, Markus Holzer 0001, Christian Rauch. The Pumping Lemma for Regular Languages is Hard. In Benedek Nagy, editor, Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings. Volume 14151 of Lecture Notes in Computer Science, pages 128-140, Springer, 2023. [doi]
Abstract is missing.