Matching Patterns with Variables Under Simon's Congruence
Pamela Fleischmann, Sungmin Kim, Tore Ko{\ss}, Florin Manea, and Dirk Nowotka, Stefan Siemer, Max Wiedenh\"oft
TL;DR
This paper explores the computational complexity of pattern matching problems involving variables under Simon's congruence, providing a comprehensive analysis of their difficulty.
Contribution
It introduces a series of matching problems with variables under Simon's congruence and thoroughly analyzes their computational complexity.
Findings
Complexity classifications for various matching problems
Identification of tractable and intractable cases
Comprehensive complexity landscape of the problems
Abstract
We introduce and investigate a series of matching problems for patterns with variables under Simon's congruence. Our results provide a thorough picture of these problems' computational complexity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Data Mining Algorithms and Applications · Advanced Database Systems and Queries