{"id":"https://openalex.org/W2158185919","doi":"https://doi.org/10.1145/2603088.2603104","title":"Two-way cost automata and cost logics over infinite trees","display_name":"Two-way cost automata and cost logics over infinite trees","publication_year":2014,"publication_date":"2014-07-14","ids":{"openalex":"https://openalex.org/W2158185919","doi":"https://doi.org/10.1145/2603088.2603104","mag":"2158185919"},"language":"en","primary_location":{"id":"doi:10.1145/2603088.2603104","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-02070744","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057152327","display_name":"Achim Blumensath","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Achim Blumensath","raw_affiliation_strings":["TU Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003426815","display_name":"Thomas Colcombet","orcid":"https://orcid.org/0000-0001-6529-6963"},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thomas Colcombet","raw_affiliation_strings":["Universit\u00e9 Paris Diderot"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Diderot","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077133539","display_name":"Denis Kuperberg","orcid":"https://orcid.org/0000-0001-5406-717X"},"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":false,"raw_author_name":"Denis Kuperberg","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085631393","display_name":"Pawe\u0142 Parys","orcid":"https://orcid.org/0000-0001-7247-1408"},"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":false,"raw_author_name":"Pawe\u0142 Parys","raw_affiliation_strings":["University of Warsaw","MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (Banacha 2, 02-097 Warsaw - Poland)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (Banacha 2, 02-097 Warsaw - Poland)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031309399","display_name":"Michael Vanden Boom","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]},{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael Vanden Boom","raw_affiliation_strings":["University of Oxford","Department of Computer Science [Oxford] (University of Oxford Wolfson Building Parks Road OXFORD OX1 3QD UK - United Kingdom)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Computer Science [Oxford] (University of Oxford Wolfson Building Parks Road OXFORD OX1 3QD UK - United Kingdom)","institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.9965999722480774,"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.9943000078201294,"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.8358182907104492},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.693372368812561},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6890220642089844},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6324909925460815},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5805838108062744},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5181813836097717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4873970150947571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47492748498916626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4739682376384735},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4265035390853882},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4158015847206116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3164200186729431},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.26843976974487305},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22897997498512268},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16241362690925598}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8358182907104492},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.693372368812561},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6890220642089844},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6324909925460815},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5805838108062744},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5181813836097717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4873970150947571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47492748498916626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4739682376384735},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4265035390853882},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4158015847206116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3164200186729431},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.26843976974487305},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22897997498512268},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16241362690925598}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2603088.2603104","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.710.6047","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.710.6047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.univ-paris-diderot.fr/%7Edkuperbe/papers/CSLLICS14.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-02070744v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02070744","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC (CSL) AND the Twenty-Ninth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS), 2014, Vienne, Austria. ⟨10.1145/2603088.2603104⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:9afc2a81-53e7-4850-ab8b-8a9acc4f334d","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02070744v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02070744","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC (CSL) AND the Twenty-Ninth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS), 2014, Vienne, Austria. ⟨10.1145/2603088.2603104⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G193626586","display_name":null,"funder_award_id":"BL 1127/2-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7410044620","display_name":null,"funder_award_id":"259454","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W14848105","https://openalex.org/W1494274610","https://openalex.org/W1517238936","https://openalex.org/W1517695114","https://openalex.org/W1525546443","https://openalex.org/W1528015591","https://openalex.org/W1546839366","https://openalex.org/W1640973035","https://openalex.org/W1816620374","https://openalex.org/W1965611063","https://openalex.org/W2054801208","https://openalex.org/W2067923908","https://openalex.org/W2084532411","https://openalex.org/W2095067686","https://openalex.org/W2105877052","https://openalex.org/W2124876285","https://openalex.org/W2131742729","https://openalex.org/W2140885135","https://openalex.org/W2145058408","https://openalex.org/W2162583406","https://openalex.org/W2164676507","https://openalex.org/W2165854715","https://openalex.org/W2168601854","https://openalex.org/W2172290937","https://openalex.org/W2173598568","https://openalex.org/W2331292038","https://openalex.org/W3022953501","https://openalex.org/W4205178514","https://openalex.org/W6631406236"],"related_works":["https://openalex.org/W2950141706","https://openalex.org/W1965531865","https://openalex.org/W2742582826","https://openalex.org/W1545660605","https://openalex.org/W1974626062","https://openalex.org/W1528592560","https://openalex.org/W2401586919","https://openalex.org/W2394954760","https://openalex.org/W2279591425","https://openalex.org/W3118644009"],"abstract_inverted_index":{"Regular":[0],"cost":[1],"functions":[2],"provide":[3],"a":[4],"quantitative":[5],"extension":[6],"of":[7,13],"regular":[8],"languages":[9],"that":[10],"retains":[11],"most":[12],"their":[14],"important":[15],"properties,":[16],"such":[17],"as":[18],"expressive":[19],"power":[20],"and":[21,27,30],"decidability,":[22],"at":[23],"least":[24],"over":[25,31,38],"finite":[26,32],"infinite":[28,39],"words":[29],"trees.":[33,40],"Much":[34],"less":[35],"is":[36],"known":[37]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}