A minimization algorithm for fuzzy top-down tree automata over lattices
| Autor: | Sunita Garhwal, Maryam Ghorani |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Statistics and Probability
Computer science General Engineering 0102 computer and information sciences 02 engineering and technology Top-down and bottom-up design 01 natural sciences Fuzzy logic Physics::Geophysics Automaton Tree (data structure) 010201 computation theory & mathematics Artificial Intelligence 0202 electrical engineering electronic engineering information engineering Minimization algorithm 020201 artificial intelligence & image processing Algorithm |
| Zdroj: | Journal of Intelligent & Fuzzy Systems. 40:4471-4480 |
| ISSN: | 1875-8967 1064-1246 |
| DOI: | 10.3233/jifs-201298 |
| Popis: | 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’t 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|