{"id":"https://openalex.org/W4297492870","doi":"https://doi.org/10.1017/s0960129522000184","title":"Synchronizing words and monoid factorization, yielding a new parameterized complexity class?","display_name":"Synchronizing words and monoid factorization, yielding a new parameterized complexity class?","publication_year":2022,"publication_date":"2022-02-01","ids":{"openalex":"https://openalex.org/W4297492870","doi":"https://doi.org/10.1017/s0960129522000184"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129522000184","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0960129522000184","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2910A2134026357AC684F256DB5C0349/S0960129522000184a.pdf/div-class-title-synchronizing-words-and-monoid-factorization-yielding-a-new-parameterized-complexity-class-div.pdf","source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2910A2134026357AC684F256DB5C0349/S0960129522000184a.pdf/div-class-title-synchronizing-words-and-monoid-factorization-yielding-a-new-parameterized-complexity-class-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015688812","display_name":"Henning Fernau","orcid":"https://orcid.org/0000-0002-4444-3220"},"institutions":[{"id":"https://openalex.org/I137932638","display_name":"Trier University of Applied Sciences","ror":"https://ror.org/02e3hdx05","country_code":"DE","type":"education","lineage":["https://openalex.org/I137932638"]},{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Henning Fernau","raw_affiliation_strings":["Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universitt Trier, Trier, Germany","Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universit\u00e4t Trier, Trier, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4444-3220","affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universitt Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525","https://openalex.org/I137932638"]},{"raw_affiliation_string":"Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universit\u00e4t Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018537951","display_name":"Jens Bruchertseifer","orcid":"https://orcid.org/0000-0003-3536-3082"},"institutions":[{"id":"https://openalex.org/I137932638","display_name":"Trier University of Applied Sciences","ror":"https://ror.org/02e3hdx05","country_code":"DE","type":"education","lineage":["https://openalex.org/I137932638"]},{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Bruchertseifer","raw_affiliation_strings":["Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universitt Trier, Trier, Germany","Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universit\u00e4t Trier, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universitt Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525","https://openalex.org/I137932638"]},{"raw_affiliation_string":"Theoretische Informatik, Abteilung Informatikwissenschaften, Fachbereich 4, Universit\u00e4t Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015688812"],"corresponding_institution_ids":["https://openalex.org/I137932638","https://openalex.org/I89864525"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14682035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"2","first_page":"189","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8882091045379639},{"id":"https://openalex.org/keywords/monoid","display_name":"Monoid","score":0.8534088134765625},{"id":"https://openalex.org/keywords/synchronizing","display_name":"Synchronizing","score":0.6598060131072998},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.6554887294769287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5690689086914062},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5666226148605347},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5177013874053955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.482907772064209},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4724079966545105},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42682385444641113},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2059638500213623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1226867139339447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11837661266326904},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.05332636833190918}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8882091045379639},{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.8534088134765625},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.6598060131072998},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.6554887294769287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5690689086914062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5666226148605347},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5177013874053955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.482907772064209},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4724079966545105},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42682385444641113},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2059638500213623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1226867139339447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11837661266326904},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.05332636833190918},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0960129522000184","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0960129522000184","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2910A2134026357AC684F256DB5C0349/S0960129522000184a.pdf/div-class-title-synchronizing-words-and-monoid-factorization-yielding-a-new-parameterized-complexity-class-div.pdf","source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0960129522000184","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0960129522000184","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2910A2134026357AC684F256DB5C0349/S0960129522000184a.pdf/div-class-title-synchronizing-words-and-monoid-factorization-yielding-a-new-parameterized-complexity-class-div.pdf","source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4297492870.pdf","grobid_xml":"https://content.openalex.org/works/W4297492870.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W104259238","https://openalex.org/W1486877437","https://openalex.org/W1550462819","https://openalex.org/W1585310225","https://openalex.org/W1829425890","https://openalex.org/W1982384331","https://openalex.org/W1991980356","https://openalex.org/W1995717557","https://openalex.org/W2005505145","https://openalex.org/W2023961800","https://openalex.org/W2027343828","https://openalex.org/W2028889910","https://openalex.org/W2030035159","https://openalex.org/W2034962669","https://openalex.org/W2039116808","https://openalex.org/W2039529128","https://openalex.org/W2044535619","https://openalex.org/W2045003095","https://openalex.org/W2048946385","https://openalex.org/W2052581866","https://openalex.org/W2053159775","https://openalex.org/W2066768040","https://openalex.org/W2073409415","https://openalex.org/W2074373676","https://openalex.org/W2102194201","https://openalex.org/W2115667895","https://openalex.org/W2122803069","https://openalex.org/W2140195055","https://openalex.org/W2490706771","https://openalex.org/W2581810698","https://openalex.org/W2586499659","https://openalex.org/W2897335006","https://openalex.org/W2911608662","https://openalex.org/W2912678774","https://openalex.org/W2914656101","https://openalex.org/W2978585909","https://openalex.org/W2998684673","https://openalex.org/W3021478446","https://openalex.org/W3022099974","https://openalex.org/W3030074021","https://openalex.org/W3091830191","https://openalex.org/W3102519952","https://openalex.org/W3191074147","https://openalex.org/W3202622153","https://openalex.org/W3210187043","https://openalex.org/W6604177632","https://openalex.org/W6607558731","https://openalex.org/W6657945432","https://openalex.org/W6669054116","https://openalex.org/W6678484213","https://openalex.org/W6768561915","https://openalex.org/W6778022372"],"related_works":["https://openalex.org/W3091830191","https://openalex.org/W2798907744","https://openalex.org/W3098927428","https://openalex.org/W2471441392","https://openalex.org/W2963569553","https://openalex.org/W4297492870","https://openalex.org/W2137931097","https://openalex.org/W1606810574","https://openalex.org/W2394942112","https://openalex.org/W2059824826"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"concept":[2],"of":[3,15,34,95,122],"a":[4,8,27,31,102,109,120],"synchronizing":[5,32],"word":[6,33],"is":[7,42,52,90],"very":[9],"important":[10],"notion":[11],"in":[12],"the":[13,20,43,55,68],"theory":[14],"finite":[16],"automata.":[17],"We":[18,46,117],"consider":[19],"associated":[21],"decision":[22],"problem":[23,50,56],"to":[24,54,79,126],"decide":[25],"if":[26],"given":[28],"DFA":[29],"possesses":[30],"length":[35],"at":[36],"most":[37],"k":[38,41],",":[39,81],"where":[40],"standard":[44],"parameter.":[45],"show":[47,74],"that":[48,75,88,124],"this":[49,134],"DFA-SW":[51,89],"equivalent":[53],"Monoid":[57],"Factorization":[58],"introduced":[59],"by":[60],"Cai,":[61],"Chen,":[62],"Downey,":[63],"and":[64,83,98],"Fellows.":[65],"Apart":[66],"from":[67],"known":[69],"$\\textsf{W}[2]$":[70],"-hardness":[71],"results,":[72],"we":[73,100],"these":[76,96,113],"problems":[77,123],"belong":[78,125],"$\\textsf{A}[2]$":[80],"$\\textsf{W}[\\textsf{P}],$":[82],"$\\textsf{WNL}$":[84],".":[85],"This":[86],"indicates":[87],"not":[91],"complete":[92,132],"for":[93,112,133],"any":[94],"classes,":[97],"hence,":[99],"suggest":[101],"new":[103,135],"parameterized":[104],"complexity":[105],"class":[106],"$\\textsf{W}[\\textsf{Sync}]$":[107,127],"as":[108],"proper":[110],"home":[111],"(and":[114],"more)":[115],"problems.":[116],"present":[118],"quite":[119],"number":[121],"or":[128,131],"are":[129],"hard":[130],"class.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}