16 July 2012 in Fuzzy Sets and Systems
26 May 2012 in Soft Computing
14 September 2017 in Soft Computing
30 January 2016 in Soft Computing
1 January 2018 in RAIRO - Theoretical Informatics and Applications
In this paper, an association is organized between the theory of tree automata on one hand and the hyperstructures on the other hand, over complete residuated lattices. To this end, the concept of order of the states of a complete residuated lattice-valued tree automaton (simply -valued tree automaton) is introduced along with several equivalence relations in the set of the states of an -valued tree automaton. We obtain two main results from this study: one of the relations can lead to the creation of Kleene’s theorem for -valued tree automata, and the other one leads to the creation of a minimal -valued tree automaton that accepts the same language as the given one.
31 March 2021 in Journal of Applied Mathematics and Computing