Matching Patterns with Variables Under Simon's Congruence

August 16, 2023 ยท The Ethereal ยท ๐Ÿ› Reachability Problems

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Pamela Fleischmann, Sungmin Kim, Tore KoรŸ, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhรถft arXiv ID 2308.08374 Category cs.FL: Formal Languages Cross-listed cs.DS Citations 12 Venue Reachability Problems Last Checked 2 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Formal Languages