{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:01:00Z","timestamp":1777705260129,"version":"3.51.4"},"reference-count":30,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,3,2]]},"abstract":"<jats:p>In this paper, we study fuzzy top-down tree automata over lattices ( LTA s , for short). The purpose of this contribution is to investigate the minimization problem for LTA s . We first define the concept of statewise equivalence between two LTA s . Thereafter, we show the existence of the statewise minimal form for an LTA . To this end, we find a statewise irreducible LTA which is equivalent to a given LTA . Then, we provide an algorithm to find the statewise minimal LTA and by a theorem, we show that the output statewise minimal LTA is statewise equivalent to the given input. Moreover, we compute the time complexity of the given algorithm. The proposed algorithm can be applied to any given LTA and, unlike some minimization algorithms given in the literature, the input doesn\u2019t need to be a complete, deterministic, or reduced lattice-valued tree automaton. Finally, we provide some examples to show the efficiency of the presented algorithm.<\/jats:p>","DOI":"10.3233\/jifs-201298","type":"journal-article","created":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T12:45:20Z","timestamp":1607690720000},"page":"4471-4480","source":"Crossref","is-referenced-by-count":0,"title":["A minimization algorithm for fuzzy top-down tree automata over lattices"],"prefix":"10.1177","volume":"40","author":[{"given":"Maryam","family":"Ghorani","sequence":"first","affiliation":[{"name":"Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunita","family":"Garhwal","sequence":"additional","affiliation":[{"name":"Department of CSED, Thapar Institute of Engineering and Technology, Patiala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"4","key":"10.3233\/JIFS-201298_ref2","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1142\/S0129054107004929","article-title":"Bisimulation minimization of tree automata","volume":"18","author":"Abdulla","year":"2007","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"10.3233\/JIFS-201298_ref3","first-page":"180","article-title":"A taxonomy of minimisation algorithms for deterministic tree automata","volume":"22","author":"Bj\u00f6rklund","year":"2016","journal-title":"Journal of Universal Computer Science"},{"key":"10.3233\/JIFS-201298_ref4","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1016\/j.fss.2009.08.008","article-title":"Fuzzy tree language recognizability","volume":"161","author":"Bozapalidis","year":"2010","journal-title":"Fuzzy Sets and Systems"},{"key":"10.3233\/JIFS-201298_ref6","first-page":"365","article-title":"Decidability of the weak second-order theory of two successors","volume":"12","author":"Doner","year":"1965","journal-title":"Notices Amer Math Soc"},{"key":"10.3233\/JIFS-201298_ref7","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","article-title":"Tree acceptors and some of their applications","volume":"4","author":"Doner","year":"1970","journal-title":"Journal of Comput and Syst Sci"},{"key":"10.3233\/JIFS-201298_ref9","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1016\/j.fss.2007.02.016","article-title":"Fuzzy tree automata","volume":"158","author":"\u00c9sik","year":"2007","journal-title":"Fuzzy Sets and Systems"},{"key":"10.3233\/JIFS-201298_ref11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.14232\/actacyb.23.1.2017.21","article-title":"Minimization of deterministic top-down tree automata","volume":"23","author":"F\u00fcl\u00f6p","year":"2017","journal-title":"Acta Cybernetica"},{"issue":"6","key":"10.3233\/JIFS-201298_ref12","doi-asserted-by":"crossref","first-page":"3123","DOI":"10.3233\/IFS-152038","article-title":"Conversion of fuzzy automata into fuzzy regular expressions using transitive closure","volume":"30","author":"Garhwal","year":"2016","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"issue":"1","key":"10.3233\/JIFS-201298_ref14","first-page":"37","article-title":"Minimal ascending tree automata","volume":"4","author":"G\u00e9cseg","year":"1978","journal-title":"Acta Cybernetica"},{"issue":"4","key":"10.3233\/JIFS-201298_ref15","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s00500-017-2829-7","article-title":"On characterization of fuzzy tree pushdown automata","volume":"23","author":"Ghorani","year":"2019","journal-title":"Soft Computing"},{"issue":"7","key":"10.3233\/JIFS-201298_ref16","first-page":"103","article-title":"Tree automata based on complete residuated lattice-valued logic: reduction algorithm and decision problem","volume":"15","author":"Ghorani","year":"2018","journal-title":"Iranian Journal of Fuzzy Systems"},{"issue":"1","key":"10.3233\/JIFS-201298_ref17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1051\/ita\/2018004","article-title":"State hyperstructures of tree automata based on lattice-valued logic","volume":"52","author":"Ghorani","year":"2018","journal-title":"RAIROTheoretical Informatics and Applications"},{"key":"10.3233\/JIFS-201298_ref18","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.fss.2011.11.010","article-title":"Characterizations of complete residuated lattice-valued finite tree automata","volume":"199","author":"Ghorani","year":"2012","journal-title":"Fuzzy Sets and Systems"},{"issue":"2","key":"10.3233\/JIFS-201298_ref19","first-page":"71","article-title":"Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic","volume":"13","author":"Ghorani","year":"2016","journal-title":"Iranian Journal of Fuzzy Systems"},{"issue":"14","key":"10.3233\/JIFS-201298_ref20","doi-asserted-by":"crossref","first-page":"3815","DOI":"10.1007\/s00500-016-2031-3","article-title":"Coding tree languages based on lattice-valued logic","volume":"21","author":"Ghorani","year":"2017","journal-title":"Soft Computing"},{"issue":"10","key":"10.3233\/JIFS-201298_ref21","doi-asserted-by":"crossref","first-page":"1723","DOI":"10.1007\/s00500-012-0856-y","article-title":"Algebraic properties of complete residuated lattice valued tree automata","volume":"16","author":"Ghorani","year":"2012","journal-title":"Soft Computing"},{"key":"10.3233\/JIFS-201298_ref22","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1109\/TNN.2004.837585","article-title":"Encoding non-deterministic fuzzy tree automata into recursive neural networks","volume":"156","author":"Gori","year":"2004","journal-title":"IEEE Trans Neur Net"},{"issue":"37","key":"10.3233\/JIFS-201298_ref24","doi-asserted-by":"crossref","first-page":"3539","DOI":"10.1016\/j.tcs.2009.03.022","article-title":"Backward and forward bisimulation minimization of tree automata","volume":"410","author":"H\u00f6gberg","year":"2009","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/JIFS-201298_ref29","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TFUZZ.2014.2315620","article-title":"On the state minimization of fuzzy automata","volume":"23","author":"Li","year":"2015","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"10.3233\/JIFS-201298_ref30","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1016\/j.fss.2007.03.003","article-title":"Minimization of lattice finite automata and its application to the decomposition of lattice languages","volume":"158","author":"Li","year":"2007","journal-title":"Fuzzy Sets and Systems"},{"issue":"11","key":"10.3233\/JIFS-201298_ref31","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1016\/j.ic.2009.01.004","article-title":"Minimizing deterministic weighted tree automata","volume":"207","author":"Maletti","year":"2009","journal-title":"Inform and Comput"},{"key":"10.3233\/JIFS-201298_ref34","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s12190-015-0877-7","article-title":"Similarity-based minimization of fuzzy tree automata","volume":"50","author":"Moghari","year":"2016","journal-title":"J Appl Math Comput"},{"key":"10.3233\/JIFS-201298_ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5899\/2014\/jfsva-00191","article-title":"Minimization of deterministic fuzzy tree automata","volume":"2014","author":"Moghari","year":"2014","journal-title":"Journal of Fuzzy Set Valued Analysis"},{"key":"10.3233\/JIFS-201298_ref36","first-page":"225","article-title":"Merging states in deterministic fuzzy finite tree automata based on fuzzy similarity measure","volume":"33","author":"Moghari","year":"2014","journal-title":"Italian Journal of Pure and Applied Mathematics"},{"issue":"3","key":"10.3233\/JIFS-201298_ref39","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","article-title":"Automata for XMLA survey","volume":"73","author":"Schwentick","year":"2007","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"10.3233\/JIFS-201298_ref40","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.3233\/IFS-151828","article-title":"Minimal realization for fuzzy behaviour: A bicategory-theoretic approach","volume":"30","author":"Tiwari","year":"2016","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"10.3233\/JIFS-201298_ref41","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","article-title":"Characterizing derivation trees of context free grammars through a generalization of finite automata theory","volume":"1","author":"Thatcher","year":"1967","journal-title":"Journal of Computer and System Sciences"},{"key":"10.3233\/JIFS-201298_ref42","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision-problem of second order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"10.3233\/JIFS-201298_ref44","doi-asserted-by":"crossref","first-page":"627","DOI":"10.3233\/JIFS-161382","article-title":"Minimization of lattice multiset finite automata","volume":"35","author":"Wang","year":"2018","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"10.3233\/JIFS-201298_ref45","first-page":"215","article-title":"A formulation of fuzzy automata and its application as a model of learning systems","volume":"5","author":"Wee","year":"1967","journal-title":"IEEE Trans Syst Man Cybern"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-201298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:21Z","timestamp":1777455801000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-201298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,2]]},"references-count":30,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/jifs-201298","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,2]]}}}