{"id":"https://openalex.org/W10842229","doi":"https://doi.org/10.1007/978-3-662-43951-7_4","title":"Weak MSO+U with Path Quantifiers over Infinite Trees","display_name":"Weak MSO+U with Path Quantifiers over Infinite Trees","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W10842229","doi":"https://doi.org/10.1007/978-3-662-43951-7_4","mag":"10842229"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-43951-7_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43951-7_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050056333","display_name":"Miko\u0142aj Boja\u0144czyk","orcid":"https://orcid.org/0000-0002-7758-1072"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Miko\u0142aj Boja\u0144czyk","raw_affiliation_strings":["University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050056333"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8029,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90262999,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"38","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.998199999332428,"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.8337088823318481},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.7429159879684448},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6480001211166382},{"id":"https://openalex.org/keywords/emptiness","display_name":"Emptiness","score":0.6216456890106201},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6017875671386719},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.551451563835144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5355657339096069},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5214335322380066},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5161619782447815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48596084117889404},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4726354479789734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4331015646457672},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4197466969490051},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31492578983306885},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17674386501312256},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10315319895744324},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09726664423942566}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8337088823318481},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.7429159879684448},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6480001211166382},{"id":"https://openalex.org/C2779150620","wikidata":"https://www.wikidata.org/wiki/Q1096367","display_name":"Emptiness","level":2,"score":0.6216456890106201},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6017875671386719},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.551451563835144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5355657339096069},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5214335322380066},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5161619782447815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48596084117889404},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4726354479789734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4331015646457672},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4197466969490051},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31492578983306885},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17674386501312256},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10315319895744324},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09726664423942566},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-43951-7_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43951-7_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W145105541","https://openalex.org/W1488092465","https://openalex.org/W1494274610","https://openalex.org/W1517238936","https://openalex.org/W1525546443","https://openalex.org/W1528015591","https://openalex.org/W1622981938","https://openalex.org/W1790689966","https://openalex.org/W2010137316","https://openalex.org/W2124876285","https://openalex.org/W2144338279","https://openalex.org/W2172290937","https://openalex.org/W2220644212","https://openalex.org/W2247050992","https://openalex.org/W2478529717","https://openalex.org/W3002839602"],"related_works":["https://openalex.org/W2400855043","https://openalex.org/W3194425546","https://openalex.org/W2765163883","https://openalex.org/W4387167325","https://openalex.org/W4379256319","https://openalex.org/W2163914337","https://openalex.org/W4376850286","https://openalex.org/W1568320863","https://openalex.org/W4302494004","https://openalex.org/W4302042593"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}