{"id":"https://openalex.org/W1533605922","doi":"https://doi.org/10.1007/978-3-642-13089-2_10","title":"Equivalence and Inclusion Problem for Strongly Unambiguous B\u00fcchi Automata","display_name":"Equivalence and Inclusion Problem for Strongly Unambiguous B\u00fcchi Automata","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1533605922","doi":"https://doi.org/10.1007/978-3-642-13089-2_10","mag":"1533605922"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13089-2_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13089-2_10","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":"conference-paper","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/A5044190443","display_name":"Nicol\u00e1s Bousquet","orcid":"https://orcid.org/0000-0003-0170-0503"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Bousquet","raw_affiliation_strings":["ENS Chachan, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENS Chachan, France","institution_ids":["https://openalex.org/I11559806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021229064","display_name":"Christof L\u00f6ding","orcid":"https://orcid.org/0000-0002-1529-2806"},"institutions":[{"id":"https://openalex.org/I4210126395","display_name":"Inform (Germany)","ror":"https://ror.org/02x8c2t37","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210126395"]},{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christof L\u00f6ding","raw_affiliation_strings":["Informatik 7, RWTH Aachen, 52056, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatik 7, RWTH Aachen, 52056, Aachen, Germany","institution_ids":["https://openalex.org/I4210126395","https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"129"},"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/T10142","display_name":"Formal Methods in Verification","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.9993000030517578,"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/equivalence","display_name":"Equivalence (formal languages)","score":0.749106764793396},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.7364233732223511},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6582804322242737},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.5720082521438599},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4660319685935974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4469951391220093},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.44318264722824097},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42822685837745667},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3451300859451294},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.32069331407546997},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2675997018814087},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2504901885986328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20803698897361755}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.749106764793396},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.7364233732223511},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6582804322242737},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.5720082521438599},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4660319685935974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4469951391220093},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.44318264722824097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42822685837745667},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3451300859451294},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.32069331407546997},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2675997018814087},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2504901885986328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20803698897361755},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-13089-2_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13089-2_10","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.4370","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.4370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.automata.rwth-aachen.de/download/papers/loeding/BL-LATA10.pdf","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:118466","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/118466","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Language and automata theory and applications : 4th International Conference, LATA 2010, Trier, Germany, May 24 - 28, 2010; proceedings / Adrian-Horia Dediu ... (eds.)<br/>Language and automata theory and applications : 4. International Conference, LATA 2010, Trier, Germany, 2010-05-24 - 2010-05-28","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7900000214576721,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W117768600","https://openalex.org/W125598877","https://openalex.org/W421997344","https://openalex.org/W1498432697","https://openalex.org/W1556439147","https://openalex.org/W1563480347","https://openalex.org/W1593799327","https://openalex.org/W1594530072","https://openalex.org/W1655990431","https://openalex.org/W1816620374","https://openalex.org/W1834767237","https://openalex.org/W2002089154","https://openalex.org/W2019789808","https://openalex.org/W2044504659","https://openalex.org/W2059200976","https://openalex.org/W2091227187","https://openalex.org/W2094912129","https://openalex.org/W2111715088","https://openalex.org/W2119397055","https://openalex.org/W2132638915","https://openalex.org/W2138856440","https://openalex.org/W4255782127","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2049315791","https://openalex.org/W2953483754","https://openalex.org/W2087949151","https://openalex.org/W2963823488","https://openalex.org/W2058117339","https://openalex.org/W1524267824","https://openalex.org/W201862490","https://openalex.org/W2133073401","https://openalex.org/W1978419739","https://openalex.org/W1510617467"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}