On the Complexity of the Matching Problem of Regular Expressions with Backreferences

Soh Kumabe, Yuya Uezato. On the Complexity of the Matching Problem of Regular Expressions with Backreferences. In Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, editors, 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026. Volume 374 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. [doi]

Abstract

Abstract is missing.