HYPERCOMPLEX L-VALUED TREE AUTOMATA

This paper deals with the concept of hypercomplex Lvalued finite tree automata (HLFTA). The behavior of an HLFTA is a hypercomplex L-valued tree language, which is a mapping from set of trees on ranked alphabets to an L-valued vector space. More exactly, an HLFTA recognizes a regular tree language while a point from an L-valued vector space is assigned to each tree. After defining the notion of HLFTA, the determinization problem in automata is extended for HLFTA and its corresponding algorithm is developed to solve this problem.