{"id":"https://openalex.org/W1685060813","doi":"https://doi.org/10.1007/978-3-540-78800-3_8","title":"Computing Simulations over Tree Automata","display_name":"Computing Simulations over Tree Automata","publication_year":2008,"publication_date":"2008-04-02","ids":{"openalex":"https://openalex.org/W1685060813","doi":"https://doi.org/10.1007/978-3-540-78800-3_8","mag":"1685060813"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-78800-3_8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-540-78800-3_8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-78800-3_8.pdf","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":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-78800-3_8.pdf","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 A. Abdulla","raw_affiliation_strings":["University of Uppsala, Sweden","University of Uppsala -Sweden >  >  >  >"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"University of Uppsala -Sweden >  >  >  >","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045477471","display_name":"Ahmed Bouajjani","orcid":"https://orcid.org/0000-0002-2060-3592"},"institutions":[{"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"]},{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ahmed Bouajjani","raw_affiliation_strings":["LIAFA, University Paris 7, France","LIAFA, University Paris 7, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIAFA, University Paris 7, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115"]},{"raw_affiliation_string":"LIAFA, University Paris 7, France#TAB#","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059358773","display_name":"Luk\u00e1\u0161 Hol\u00edk","orcid":"https://orcid.org/0000-0001-6957-1651"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Luk\u00e1\u0161 Hol\u00edk","raw_affiliation_strings":["FIT, Brno University of Technology, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FIT, Brno University of Technology, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031470842","display_name":"Lisa Kaati","orcid":"https://orcid.org/0000-0002-3724-7504"},"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":"Lisa Kaati","raw_affiliation_strings":["University of Uppsala, Sweden","University of Uppsala -Sweden >  >  >  >"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"University of Uppsala -Sweden >  >  >  >","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086446392","display_name":"Tom\u00e1\u0161 Vojnar","orcid":"https://orcid.org/0000-0002-2746-8792"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Vojnar","raw_affiliation_strings":["FIT, Brno University of Technology, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FIT, Brno University of Technology, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":42,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"93","last_page":"108"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9993000030517578,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9986000061035156,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7024706602096558},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6816200017929077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6429221630096436},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5688661336898804},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5526835322380066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5235559344291687},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4908764958381653},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.46479907631874084},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4585120677947998},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.44412681460380554},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.443261981010437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.388908326625824},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.37019360065460205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2844816744327545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27162742614746094},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08995002508163452}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7024706602096558},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6816200017929077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6429221630096436},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5688661336898804},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5526835322380066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5235559344291687},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4908764958381653},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46479907631874084},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4585120677947998},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.44412681460380554},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.443261981010437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.388908326625824},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.37019360065460205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2844816744327545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27162742614746094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08995002508163452},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-78800-3_8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-540-78800-3_8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-78800-3_8.pdf","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"}],"best_oa_location":{"id":"doi:10.1007/978-3-540-78800-3_8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-540-78800-3_8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-78800-3_8.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322771","display_name":"Secret\u00e1rio de Ci\u00eancia, Tecnologia e Ensino Superior, Governo do Estado de Parana","ror":"https://ror.org/05nyhnc56"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1685060813.pdf"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1522742464","https://openalex.org/W1526231760","https://openalex.org/W1569690296","https://openalex.org/W1586668623","https://openalex.org/W1593799327","https://openalex.org/W1975745970","https://openalex.org/W2068361557","https://openalex.org/W2091043802","https://openalex.org/W2098817244","https://openalex.org/W2101989701","https://openalex.org/W2114036236","https://openalex.org/W2117952194","https://openalex.org/W2141408630","https://openalex.org/W2246750081","https://openalex.org/W2395745067","https://openalex.org/W2561675875"],"related_works":["https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W4386400090","https://openalex.org/W2368684504","https://openalex.org/W1975910189","https://openalex.org/W2269685284","https://openalex.org/W277366380","https://openalex.org/W2371400076","https://openalex.org/W2169203237","https://openalex.org/W2057386223"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"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":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}