State hyperstructures of tree automata based on lattice-valued logic

Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran

^* Corresponding author: Ghorani@shahroodut.ac.ir

Received: 14 December 2016
Accepted: 14 May 2018

Abstract

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 L-valued tree automaton) is introduced along with several equivalence relations in the set of the states of an L-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 L-valued tree automata, and the other one leads to the creation of a minimal v-valued tree automaton that accepts the same language as the given one.