{"id":"https://openalex.org/W3092431169","doi":"https://doi.org/10.1142/s012905412041004x","title":"Projection for B\u00fcchi Tree Automata with Constraints between Siblings","display_name":"Projection for B\u00fcchi Tree Automata with Constraints between Siblings","publication_year":2020,"publication_date":"2020-09-01","ids":{"openalex":"https://openalex.org/W3092431169","doi":"https://doi.org/10.1142/s012905412041004x","mag":"3092431169"},"language":"en","primary_location":{"id":"doi:10.1142/s012905412041004x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905412041004x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","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/A5004238068","display_name":"Patrick Landwehr","orcid":null},"institutions":[{"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":true,"raw_author_name":"Patrick Landwehr","raw_affiliation_strings":["RWTH-Aachen University, Ahornstr. 55, 52072 Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH-Aachen University, Ahornstr. 55, 52072 Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"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/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":["RWTH-Aachen University, Ahornstr. 55, 52072 Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH-Aachen University, Ahornstr. 55, 52072 Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004238068"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16279869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"06","first_page":"749","last_page":"775"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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/T11567","display_name":"semigroups and automata theory","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/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.9975000023841858,"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.7756831645965576},{"id":"https://openalex.org/keywords/emptiness","display_name":"Emptiness","score":0.6446658372879028},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6269544959068298},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5959261655807495},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5813599824905396},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5638203024864197},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5313718318939209},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.46775364875793457},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4647350311279297},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39577439427375793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39086270332336426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2855530381202698},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12850603461265564},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08345434069633484}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7756831645965576},{"id":"https://openalex.org/C2779150620","wikidata":"https://www.wikidata.org/wiki/Q1096367","display_name":"Emptiness","level":2,"score":0.6446658372879028},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6269544959068298},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5959261655807495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5813599824905396},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5638203024864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5313718318939209},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46775364875793457},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4647350311279297},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39577439427375793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39086270332336426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2855530381202698},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12850603461265564},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08345434069633484},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","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.1142/s012905412041004x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905412041004x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1490858874","https://openalex.org/W1498432697","https://openalex.org/W1569718229","https://openalex.org/W1816620374","https://openalex.org/W1997436239","https://openalex.org/W2035020702","https://openalex.org/W2050073538","https://openalex.org/W2076284895","https://openalex.org/W2130982189","https://openalex.org/W2151788193","https://openalex.org/W2162583406","https://openalex.org/W2530218450","https://openalex.org/W2971268466"],"related_works":["https://openalex.org/W2506746226","https://openalex.org/W2109489765","https://openalex.org/W3104737963","https://openalex.org/W1886746238","https://openalex.org/W2182252111","https://openalex.org/W4300013286","https://openalex.org/W2021535402","https://openalex.org/W2610542549","https://openalex.org/W1548463674","https://openalex.org/W3174875281"],"abstract_inverted_index":{"We":[0],"consider":[1],"an":[2,116],"extension":[3,117],"of":[4,20,35,49,64,118],"tree":[5,69,94],"automata":[6,36,70],"on":[7],"infinite":[8],"trees":[9],"that":[10,28,45,61,91],"can":[11,107],"use":[12],"equality":[13],"and":[14,44,106],"disequality":[15],"constraints":[16],"between":[17],"direct":[18],"subtrees":[19],"a":[21,38,72,83,92,112],"node.":[22],"Recently,":[23],"it":[24],"has":[25],"been":[26],"shown":[27],"the":[29,46,62,87,98,103],"emptiness":[30,88],"problem":[31],"for":[32,86,115,124],"these":[33],"kind":[34],"with":[37,71,122],"parity":[39],"acceptance":[40,74],"condition":[41,75],"is":[42,51,76,95,100],"decidable":[43],"corresponding":[47],"class":[48,63],"languages":[50,65],"closed":[52,77],"under":[53,78],"Boolean":[54],"operations.":[55],"In":[56],"this":[57],"paper,":[58],"we":[59],"show":[60],"recognizable":[66],"by":[67],"such":[68],"B\u00fcchi":[73,104],"projection.":[79],"This":[80],"construction":[81],"yields":[82],"new":[84],"algorithm":[85],"problem,":[89],"implies":[90],"regular":[93],"accepted":[96],"if":[97],"language":[99],"non-empty":[101],"(for":[102],"condition),":[105],"be":[108],"used":[109],"to":[110],"obtain":[111],"decision":[113],"procedure":[114],"monadic":[119],"second-order":[120],"logic":[121],"predicates":[123],"subtree":[125],"comparisons.":[126]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}