{"id":"https://openalex.org/W2112476716","doi":"https://doi.org/10.1137/s0097539793304741","title":"The Complexity of Tree Automata and Logics of Programs","display_name":"The Complexity of Tree Automata and Logics of Programs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2112476716","doi":"https://doi.org/10.1137/s0097539793304741","mag":"2112476716"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793304741","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793304741","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5022535511","display_name":"E. Allen Emerson","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. Allen Emerson","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048218857","display_name":"Charanjit S. Jutla","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charanjit S. Jutla","raw_affiliation_strings":["IBM, ,"],"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022535511"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9536,"has_fulltext":false,"cited_by_count":139,"citation_normalized_percentile":{"value":0.86500678,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"29","issue":"1","first_page":"132","last_page":"158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9988999962806702,"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/T11567","display_name":"semigroups and automata theory","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7601102590560913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6554955840110779},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5816319584846497},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.5017614364624023},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4856804609298706},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.47505781054496765},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43783101439476013},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4319021701812744},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.2436714470386505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2055743932723999},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1602107286453247}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7601102590560913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6554955840110779},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5816319584846497},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.5017614364624023},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4856804609298706},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.47505781054496765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43783101439476013},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4319021701812744},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.2436714470386505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2055743932723999},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1602107286453247},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793304741","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793304741","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W117768600","https://openalex.org/W1967494119","https://openalex.org/W1975657455","https://openalex.org/W2003227046","https://openalex.org/W2004306067","https://openalex.org/W2007981995","https://openalex.org/W2015640848","https://openalex.org/W2022228153","https://openalex.org/W2033071128","https://openalex.org/W2048355938","https://openalex.org/W2069709605","https://openalex.org/W2072887965","https://openalex.org/W2078472377","https://openalex.org/W2094912129","https://openalex.org/W4212901716","https://openalex.org/W4248784701"],"related_works":["https://openalex.org/W1650701334","https://openalex.org/W2531137472","https://openalex.org/W2040640762","https://openalex.org/W2017112542","https://openalex.org/W2245221074","https://openalex.org/W3115410114","https://openalex.org/W2167738204","https://openalex.org/W4283816124","https://openalex.org/W2029164961","https://openalex.org/W2163151383"],"abstract_inverted_index":{"The":[0,58],"complexity":[1],"of":[2,5,74],"testing":[3],"nonemptiness":[4,35,60],"finite":[6],"state":[7],"automata":[8,20],"on":[9],"infinite":[10],"trees":[11],"is":[12,15,46,51,110],"investigated.":[13],"It":[14],"shown":[16,47],"that":[17,48,91,111],"for":[18,69,93,113,124],"tree":[19],"with":[21,77,118],"the":[22,49,78,94,125],"pairs":[23],"(or":[24,55],"complemented":[25],"pairs)":[26],"acceptance":[27],"condition":[28],"having":[29],"m":[30],"states":[31],"and":[32,123],"n":[33],"pairs,":[34],"can":[36,100,129],"be":[37,101,130],"tested":[38,102,131],"in":[39,52,103,132],"deterministic":[40,104,133],"time":[41,97],"(mn)O(n)":[42],";":[43],"however,":[44],"it":[45,89],"problem":[50],"general":[53],"NP-complete":[54],"co-NP-complete,":[56],"respectively).":[57],"new":[59],"algorithm":[61],"yields":[62],"exponentially":[63],"improved,":[64],"essentially":[65],"tight":[66],"upper":[67],"bounds":[68],"numerous":[70],"important":[71],"modal":[72],"logics":[73],"programs,":[75],"interpreted":[76],"usual":[79],"semantics":[80],"over":[81],"structures":[82],"generated":[83],"by":[84],"binary":[85],"relations.":[86],"For":[87],"example,":[88],"follows":[90],"satisfiability":[92,112],"full":[95],"branching":[96],"logic":[98,116],"CTL*":[99],"double":[105],"exponential":[106,135],"time.":[107,136],"Another":[108],"consequence":[109],"propositional":[114,126],"dynamic":[115],"(PDL)":[117],"a":[119],"repetition":[120],"construct":[121],"(PDL-delta)":[122],"Mu-calculus":[127],"($L\\mu$)":[128],"single":[134]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}