{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:50:23Z","timestamp":1770270623221,"version":"3.49.0"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,8]]},"abstract":"<jats:p> We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize nondeterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of [Formula: see text], where [Formula: see text] is the maximum rank of any symbol in the input alphabet, m is the total size of the transition table, and n is the number of states. <\/jats:p>","DOI":"10.1142\/s0129054107004929","type":"journal-article","created":{"date-parts":[[2007,7,30]],"date-time":"2007-07-30T11:29:46Z","timestamp":1185794986000},"page":"699-713","source":"Crossref","is-referenced-by-count":8,"title":["BISIMULATION MINIMIZATION OF TREE AUTOMATA"],"prefix":"10.1142","volume":"18","author":[{"given":"PAROSH AZIZ","family":"ABDULLA","sequence":"first","affiliation":[{"name":"Dept. of Information Technology, Uppsala University, P.O. Box 337, S\u2013751 05 Uppsala, Sweden"}]},{"given":"JOHANNA","family":"H\u00d6GBERG","sequence":"additional","affiliation":[{"name":"Department of Computing Science, Ume\u00e5 University, S\u2013901 87 Ume\u00e5, Sweden"}]},{"given":"LISA","family":"KAATI","sequence":"additional","affiliation":[{"name":"Dept. of Information Technology, Uppsala University, P.O. Box 337, S\u2013751 05 Uppsala, Sweden"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2006.02.001"},{"key":"rf6","first-page":"484","volume":"13","author":"Brainerd W. S.","journal-title":"Information and Computation"},{"key":"rf11","first-page":"189","author":"Hopcroft J. E.","journal-title":"Theory of Machines and Computations"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00103-1"},{"key":"rf13","series-title":"LNCS","volume":"92","author":"Milner R.","year":"1980"},{"key":"rf14","author":"Martens W.","journal-title":"JCSS"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539789164078"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107004929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:42:16Z","timestamp":1565138536000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107004929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,8]]}},"alternative-id":["10.1142\/S0129054107004929"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107004929","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}