{"id":"https://openalex.org/W1970599921","doi":"https://doi.org/10.1016/s0304-3975(01)00301-2","title":"Query automata over finite trees","display_name":"Query automata over finite trees","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W1970599921","doi":"https://doi.org/10.1016/s0304-3975(01)00301-2","mag":"1970599921"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00301-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00301-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1942/596","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022264843","display_name":"Frank Neven","orcid":"https://orcid.org/0000-0002-7143-1903"},"institutions":[{"id":"https://openalex.org/I4210127597","display_name":"Transnational University Limburg","ror":"https://ror.org/02xyaf767","country_code":"BE","type":"education","lineage":["https://openalex.org/I4210127597"]},{"id":"https://openalex.org/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Frank Neven","raw_affiliation_strings":["Dept. WNI, Limburgs Universitair Centrum, Universitaire Campus, 3590 Diepenbeek, Belgium","Univ. Campus, Diepenbeek, Belgium#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. WNI, Limburgs Universitair Centrum, Universitaire Campus, 3590 Diepenbeek, Belgium","institution_ids":["https://openalex.org/I4210127597"]},{"raw_affiliation_string":"Univ. Campus, Diepenbeek, Belgium#TAB#","institution_ids":["https://openalex.org/I878454856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031710345","display_name":"Thomas Schwentick","orcid":"https://orcid.org/0000-0002-1062-922X"},"institutions":[{"id":"https://openalex.org/I161103922","display_name":"Philipps University of Marburg","ror":"https://ror.org/01rdrb571","country_code":"DE","type":"education","lineage":["https://openalex.org/I161103922"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thomas Schwentick","raw_affiliation_strings":["Philipps-Universit\u00e4t Marburg, Fachbereich Mathematik und Informatik, Hans-Meerwein-Strasse, D-35032 Marburg, Germany","Philipps University Marburg,Marburg,Germany"],"affiliations":[{"raw_affiliation_string":"Philipps-Universit\u00e4t Marburg, Fachbereich Mathematik und Informatik, Hans-Meerwein-Strasse, D-35032 Marburg, Germany","institution_ids":["https://openalex.org/I161103922"]},{"raw_affiliation_string":"Philipps University Marburg,Marburg,Germany","institution_ids":["https://openalex.org/I161103922"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022264843","https://openalex.org/A5031710345"],"corresponding_institution_ids":["https://openalex.org/I161103922","https://openalex.org/I4210127597","https://openalex.org/I878454856"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":13.257,"has_fulltext":false,"cited_by_count":121,"citation_normalized_percentile":{"value":0.99255183,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"275","issue":"1-2","first_page":"633","last_page":"674"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/T12029","display_name":"DNA and Biological Computing","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7840598821640015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5644000172615051},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5559144020080566},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5395990610122681},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5263470411300659},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.49990248680114746},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4879855513572693},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.47987237572669983},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.4708549380302429},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.44600948691368103},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.419631689786911},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40309178829193115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3514501750469208},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3103654682636261},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1765460968017578},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.17224624752998352},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.13586142659187317},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11012294888496399}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7840598821640015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5644000172615051},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5559144020080566},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5395990610122681},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5263470411300659},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.49990248680114746},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4879855513572693},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.47987237572669983},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.4708549380302429},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.44600948691368103},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.419631689786911},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40309178829193115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3514501750469208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3103654682636261},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1765460968017578},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.17224624752998352},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.13586142659187317},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11012294888496399},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(01)00301-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00301-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:documentserver.uhasselt.be:1942/596","is_oa":true,"landing_page_url":"http://hdl.handle.net/1942/596","pdf_url":null,"source":{"id":"https://openalex.org/S4306401926","display_name":"Document Server@UHasselt (UHasselt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I878454856","host_organization_name":"Hasselt University","host_organization_lineage":["https://openalex.org/I878454856"],"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:documentserver.uhasselt.be:1942/596","is_oa":true,"landing_page_url":"http://hdl.handle.net/1942/596","pdf_url":null,"source":{"id":"https://openalex.org/S4306401926","display_name":"Document Server@UHasselt (UHasselt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I878454856","host_organization_name":"Hasselt University","host_organization_lineage":["https://openalex.org/I878454856"],"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":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W33041674","https://openalex.org/W55312279","https://openalex.org/W151728962","https://openalex.org/W1482193060","https://openalex.org/W1496324428","https://openalex.org/W1496394707","https://openalex.org/W1527664624","https://openalex.org/W1535627680","https://openalex.org/W1535740288","https://openalex.org/W1538930674","https://openalex.org/W1540080689","https://openalex.org/W1558832481","https://openalex.org/W1560626952","https://openalex.org/W1578783368","https://openalex.org/W1584587517","https://openalex.org/W1600484659","https://openalex.org/W1660390307","https://openalex.org/W1747717485","https://openalex.org/W1816184685","https://openalex.org/W1816620374","https://openalex.org/W1938581950","https://openalex.org/W1973145926","https://openalex.org/W1978405212","https://openalex.org/W1982169430","https://openalex.org/W1984295127","https://openalex.org/W1987027130","https://openalex.org/W1999872993","https://openalex.org/W2002089154","https://openalex.org/W2003804054","https://openalex.org/W2013618518","https://openalex.org/W2014144845","https://openalex.org/W2018334143","https://openalex.org/W2028071366","https://openalex.org/W2029752177","https://openalex.org/W2030473999","https://openalex.org/W2035020702","https://openalex.org/W2051146345","https://openalex.org/W2057841333","https://openalex.org/W2061628264","https://openalex.org/W2069436890","https://openalex.org/W2072604204","https://openalex.org/W2073663206","https://openalex.org/W2083001584","https://openalex.org/W2106181999","https://openalex.org/W2131742729","https://openalex.org/W2132750992","https://openalex.org/W2502590327","https://openalex.org/W3148337145","https://openalex.org/W4205178514","https://openalex.org/W4206031975","https://openalex.org/W4211152277","https://openalex.org/W4302339081","https://openalex.org/W6629659661","https://openalex.org/W6632584238","https://openalex.org/W6634196652","https://openalex.org/W6637881232","https://openalex.org/W6638439185"],"related_works":["https://openalex.org/W2033265717","https://openalex.org/W2584847196","https://openalex.org/W1539443054","https://openalex.org/W1545660605","https://openalex.org/W2016122306","https://openalex.org/W4386351167","https://openalex.org/W2147159309","https://openalex.org/W2583438689","https://openalex.org/W167266966","https://openalex.org/W1574273323"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}