{"id":"https://openalex.org/W2171874918","doi":"https://doi.org/10.1007/978-3-540-31980-1_3","title":"Simulation-Based Iteration of Tree Transducers","display_name":"Simulation-Based Iteration of Tree Transducers","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2171874918","doi":"https://doi.org/10.1007/978-3-540-31980-1_3","mag":"2171874918"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-31980-1_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-31980-1_3","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/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Dept. of Information Technology, Uppsala University, P.O. Box 337, SE-751 05, Uppsala, Sweden","Dept. of Information Technology, Uppsala University, P.O.\u00a0Box\u00a0337, SE-751\u00a005, Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, P.O. Box 337, SE-751 05, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, P.O.\u00a0Box\u00a0337, SE-751\u00a005, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030129842","display_name":"Axel Legay","orcid":"https://orcid.org/0000-0003-2287-8925"},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Axel Legay","raw_affiliation_strings":["Institut Montefiore, B28, Universit\u00e9 de Li\u00e8ge, 4000, Li\u00e8ge, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Montefiore, B28, Universit\u00e9 de Li\u00e8ge, 4000, Li\u00e8ge, Belgium","institution_ids":["https://openalex.org/I157674565"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091288276","display_name":"Julien d\u2019Orso","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Julien d\u2019Orso","raw_affiliation_strings":["IRCCyN - UMR CNRS 6597, BP 92 101, 44321, Nantes CEDEX 03, France","IRCCyN\u00a0-\u00a0UMR\u00a0CNRS\u00a06597, BP\u00a092\u00a0101, 44321, Nantes\u00a0CEDEX\u00a003, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRCCyN - UMR CNRS 6597, BP 92 101, 44321, Nantes CEDEX 03, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"IRCCyN\u00a0-\u00a0UMR\u00a0CNRS\u00a06597, BP\u00a092\u00a0101, 44321, Nantes\u00a0CEDEX\u00a003, France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087431438","display_name":"Ahmed Rezine","orcid":"https://orcid.org/0000-0002-0440-4753"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ahmed Rezine","raw_affiliation_strings":["Dept. of Information Technology, Uppsala University, P.O. Box 337, SE-751 05, Uppsala, Sweden","Dept. of Information Technology, Uppsala University, P.O.\u00a0Box\u00a0337, SE-751\u00a005, Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, P.O. Box 337, SE-751 05, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, P.O.\u00a0Box\u00a0337, SE-751\u00a005, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.641,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.90544185,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"30","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/transitive-closure","display_name":"Transitive closure","score":0.8657650947570801},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.673993706703186},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6664961576461792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6616045832633972},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.5831915140151978},{"id":"https://openalex.org/keywords/transducer","display_name":"Transducer","score":0.559431791305542},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5436202883720398},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.533571183681488},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5118793249130249},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49910593032836914},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.486752986907959},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.481201708316803},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.47730553150177},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.46479055285453796},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4593823552131653},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42614108324050903},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.41187646985054016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36367136240005493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.245496928691864},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24024921655654907},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07845860719680786},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07591831684112549}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8657650947570801},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.673993706703186},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6664961576461792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6616045832633972},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.5831915140151978},{"id":"https://openalex.org/C56318395","wikidata":"https://www.wikidata.org/wiki/Q215928","display_name":"Transducer","level":2,"score":0.559431791305542},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5436202883720398},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.533571183681488},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5118793249130249},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49910593032836914},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.486752986907959},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.481201708316803},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.47730553150177},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.46479055285453796},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4593823552131653},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42614108324050903},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.41187646985054016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36367136240005493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.245496928691864},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24024921655654907},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07845860719680786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07591831684112549},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-31980-1_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-31980-1_3","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:dial.uclouvain.be:boreal:217308","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/217308","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1498256026","https://openalex.org/W1504438699","https://openalex.org/W1508979488","https://openalex.org/W1526231760","https://openalex.org/W1526786777","https://openalex.org/W1547793878","https://openalex.org/W1560050980","https://openalex.org/W1569690296","https://openalex.org/W1593799327","https://openalex.org/W1860772589","https://openalex.org/W1861590051","https://openalex.org/W1968448471","https://openalex.org/W2019881090","https://openalex.org/W2088586972","https://openalex.org/W2098817244","https://openalex.org/W2101989701","https://openalex.org/W2510114496","https://openalex.org/W2914517473","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2963892764","https://openalex.org/W2798731600","https://openalex.org/W1907323098","https://openalex.org/W2390824667","https://openalex.org/W4311375192","https://openalex.org/W225111951","https://openalex.org/W3022461496","https://openalex.org/W2043459883","https://openalex.org/W2097054886","https://openalex.org/W2121026849"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}