{"id":"https://openalex.org/W2118707006","doi":"https://doi.org/10.1142/s0129054107004929","title":"BISIMULATION MINIMIZATION OF TREE AUTOMATA","display_name":"BISIMULATION MINIMIZATION OF TREE AUTOMATA","publication_year":2007,"publication_date":"2007-07-30","ids":{"openalex":"https://openalex.org/W2118707006","doi":"https://doi.org/10.1142/s0129054107004929","mag":"2118707006"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054107004929","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054107004929","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/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"]},{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"PAROSH AZIZ ABDULLA","raw_affiliation_strings":["Dept. of Information Technology, Uppsala University, P.O. Box 337, S\u2013751 05 Uppsala, Sweden","Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, P.O. Box 337, S\u2013751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086170422","display_name":"Johanna H\u00f6gberg","orcid":null},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"JOHANNA H\u00d6GBERG","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, S\u2013901 87 Ume\u00e5, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, S\u2013901 87 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","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"]},{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"LISA KAATI","raw_affiliation_strings":["Dept. of Information Technology, Uppsala University, P.O. Box 337, S\u2013751 05 Uppsala, Sweden","Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, P.O. Box 337, S\u2013751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002478680"],"corresponding_institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"],"apc_list":null,"apc_paid":null,"fwci":2.6203,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.89752749,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"18","issue":"04","first_page":"699","last_page":"713"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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.9993000030517578,"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.9991000294685364,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9914000034332275,"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/bisimulation","display_name":"Bisimulation","score":0.7895287275314331},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7191159129142761},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6508840918540955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5790601372718811},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.509053647518158},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5001633167266846},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.48368367552757263},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45938044786453247},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.4564949572086334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4351765811443329},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40909677743911743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33607929944992065},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2847776412963867},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22911468148231506}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.7895287275314331},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7191159129142761},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6508840918540955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5790601372718811},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.509053647518158},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5001633167266846},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.48368367552757263},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45938044786453247},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.4564949572086334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4351765811443329},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40909677743911743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33607929944992065},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2847776412963867},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22911468148231506},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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":2,"locations":[{"id":"doi:10.1142/s0129054107004929","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054107004929","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.103.9310","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.9310","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umu.se/research/reports/2006/025/part1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1579407214","https://openalex.org/W1762311305","https://openalex.org/W1968448471","https://openalex.org/W1999406522","https://openalex.org/W2007464118","https://openalex.org/W2052395110","https://openalex.org/W2057427285","https://openalex.org/W2068361557","https://openalex.org/W2091043802","https://openalex.org/W2137865376","https://openalex.org/W2963541987","https://openalex.org/W4231393247"],"related_works":["https://openalex.org/W1704074244","https://openalex.org/W2113256684","https://openalex.org/W40031358","https://openalex.org/W2145454356","https://openalex.org/W2140646474","https://openalex.org/W1596619087","https://openalex.org/W3014656961","https://openalex.org/W2101922810","https://openalex.org/W2534853293","https://openalex.org/W1982464584"],"abstract_inverted_index":{"We":[0,34],"extend":[1],"an":[2,40],"algorithm":[3,21,38],"by":[4],"Paige":[5],"and":[6,71],"Tarjan":[7],"that":[8,36],"solves":[9],"the":[10,16,52,59,64,68,74],"coarsest":[11],"stable":[12],"refinement":[13],"problem":[14],"to":[15,24,32],"domain":[17],"of":[18,43,55,67,76],"trees.":[19],"The":[20],"is":[22,51,63,73],"used":[23],"minimize":[25],"nondeterministic":[26],"tree":[27],"automata":[28],"(NTA)":[29],"with":[30],"respect":[31],"bisimulation.":[33],"show":[35],"our":[37],"has":[39],"overall":[41],"complexity":[42],"[Formula:":[44,48],"see":[45,49],"text],":[46],"where":[47],"text]":[50],"maximum":[53],"rank":[54],"any":[56],"symbol":[57],"in":[58],"input":[60],"alphabet,":[61],"m":[62],"total":[65],"size":[66],"transition":[69],"table,":[70],"n":[72],"number":[75],"states.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}