{"id":"https://openalex.org/W2166971839","doi":"https://doi.org/10.1145/2500365.2500612","title":"Verified decision procedures for MSO on words based on derivatives of regular expressions","display_name":"Verified decision procedures for MSO on words based on derivatives of regular expressions","publication_year":2013,"publication_date":"2013-09-25","ids":{"openalex":"https://openalex.org/W2166971839","doi":"https://doi.org/10.1145/2500365.2500612","mag":"2166971839"},"language":"en","primary_location":{"id":"doi:10.1145/2500365.2500612","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500365.2500612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.11850/106053","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046106256","display_name":"Dmitriy Traytel","orcid":"https://orcid.org/0000-0001-7982-2768"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dmitriy Traytel","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062636889","display_name":"Tobias Nipkow","orcid":"https://orcid.org/0000-0003-0730-515X"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Nipkow","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046106256"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":1.4795,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.83859027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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":0.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8237271308898926},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.7469727993011475},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6983786821365356},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5865887403488159},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5760822892189026},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.56270432472229},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5595295429229736},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4869631230831146},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.42039090394973755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3869496285915375},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3690752387046814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34274619817733765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3295099139213562},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3237568736076355},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2545565366744995},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.24774742126464844}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8237271308898926},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7469727993011475},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6983786821365356},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5865887403488159},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5760822892189026},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.56270432472229},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5595295429229736},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4869631230831146},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.42039090394973755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3869496285915375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3690752387046814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34274619817733765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3295099139213562},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3237568736076355},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2545565366744995},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.24774742126464844}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2500365.2500612","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500365.2500612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.706.9574","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.706.9574","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.inf.ethz.ch/trayteld/papers/icfp13-mso/mso.pdf","raw_type":"text"},{"id":"pmh:oai:doc.rero.ch:301003","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400148","display_name":"reroDoc Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/106053","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/106053","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Functional Programming, 25","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.3929/ethz-b-000106053","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000106053","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/106053","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/106053","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Functional Programming, 25","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G5106512922","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6024419964","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1713610","https://openalex.org/W22986477","https://openalex.org/W46198887","https://openalex.org/W69247107","https://openalex.org/W129467524","https://openalex.org/W1500313939","https://openalex.org/W1509918383","https://openalex.org/W1515948700","https://openalex.org/W1523874359","https://openalex.org/W1532290481","https://openalex.org/W1533628269","https://openalex.org/W1578881602","https://openalex.org/W1600140070","https://openalex.org/W1816620374","https://openalex.org/W1818793721","https://openalex.org/W1968602591","https://openalex.org/W1971841096","https://openalex.org/W1975501418","https://openalex.org/W2049814260","https://openalex.org/W2094985106","https://openalex.org/W2106192381","https://openalex.org/W2110992886","https://openalex.org/W2156429182","https://openalex.org/W2159882284","https://openalex.org/W2161151447","https://openalex.org/W2188521969","https://openalex.org/W2235749104","https://openalex.org/W4285719527","https://openalex.org/W4388216468","https://openalex.org/W6600923205","https://openalex.org/W6630617832","https://openalex.org/W6630970015","https://openalex.org/W6631873626","https://openalex.org/W6638422867"],"related_works":["https://openalex.org/W2964091527","https://openalex.org/W1582705003","https://openalex.org/W2603910788","https://openalex.org/W2105843429","https://openalex.org/W2280368318","https://openalex.org/W2613180196","https://openalex.org/W2057841333","https://openalex.org/W2998521476","https://openalex.org/W4362647917","https://openalex.org/W2798603509"],"abstract_inverted_index":{"Monadic":[0],"second-order":[1],"logic":[2,12],"on":[3,59,62,80],"finite":[4],"words":[5],"(MSO)":[6],"is":[7,56],"a":[8,47],"decidable":[9],"yet":[10],"expressive":[11],"into":[13],"which":[14],"many":[15],"decision":[16,50],"problems":[17],"can":[18,32],"be":[19,33],"encoded.":[20],"Since":[21],"MSO":[22,30,53],"formulas":[23,31,54],"correspond":[24],"to":[25,35],"regular":[26,40,63,73],"languages,":[27],"equivalence":[28,37],"of":[29,38],"reduced":[34],"the":[36],"some":[39],"structures":[41],"(e.g.":[42],"automata).":[43],"This":[44],"paper":[45],"presents":[46],"verified":[48,91],"functional":[49],"procedure":[51],"for":[52,70],"that":[55],"not":[57],"based":[58],"automata":[60],"but":[61],"expressions.":[64],"Functional":[65],"languages":[66],"are":[67,75,82,90],"ideally":[68],"suited":[69],"this":[71],"task:":[72],"expressions":[74],"data":[76],"types":[77],"and":[78,87,89],"functions":[79],"them":[81],"defined":[83],"by":[84,92],"pattern":[85],"matching":[86],"recursion":[88],"structural":[93],"induction.":[94]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}