Isomorphism between L-valued tree automata and upper semilattice

Abstract

This study aims to investigate the characterization of algebraic concepts of subautomaton, retrievability and connectivity of an L-valued tree automaton based on its related layers. It also seeks to associate upper semilattices with L-valued tree automata. Further, a decomposition of an L-valued tree automaton is provided in terms of its layers. In addition, it proposes a construction of an L-valued tree automaton which corresponds to a given finite poset. Then an isomorphism is established between the poset of class of subautomaton of an L-valued tree automaton and an upper semilattice.