Pamela Fleischmann, Sungmin Kim, Tore Koss, F. Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft
{"title":"西蒙同余下变量匹配模式","authors":"Pamela Fleischmann, Sungmin Kim, Tore Koss, F. Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft","doi":"10.48550/arXiv.2308.08374","DOIUrl":null,"url":null,"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.","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Matching Patterns with Variables Under Simon's Congruence\",\"authors\":\"Pamela Fleischmann, Sungmin Kim, Tore Koss, F. Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft\",\"doi\":\"10.48550/arXiv.2308.08374\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":404583,\"journal\":{\"name\":\"Reachability Problems\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Reachability Problems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2308.08374\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reachability Problems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2308.08374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Matching Patterns with Variables Under Simon's Congruence
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
