The Properties And Regular Expressions Of Two Types Of Fuzzy Finite Tree Automata

Algebraic properties and languages of the finite automaton is one of the most important issuesabout the theory of finite automaton． In this paper, we would discussed some algebraic properties onlattice semigroup tree automata from the view of algebraic． And we discuss the relation between therecognizable languages of fuzzy tree automata and fuzzy regular expression． This thesis is divided intothree chapters． The contents of the thesis are listed as follow:The chapter one, we mainly introduce the basic concepts of the semigroup, lattice andlattice-semigroup and the congruence and homomorphism on lattice-ordered monoid．The chapter two, the notion lattice semigroup tree automata is introduced and studied the threedifferent kinds of lattice semigroup tree automata．We prove the lattice semigroup tree automata form alattice semigroup and discuss some algebraic properties on lattice semigroup tree automata．And the partialorder of (l,∑, Θ) lattice elements in lattice-semigroup tree automata(LSTA) is defined in this paper．Weproved the existence of semilattices and lattices formed by different types of LSTA．Finally, we investigatethe congruence and homomorphism of lattice-semigroup by LSTA formed from the algebra angle, then weobtain homomorphism fundamental theorem of the LSTA．The chapter three, we define the concept of fuzzy tree substitution, fuzzy tree concatenation and fuzzytree closure with classical tree automata theory．It proves that we can still obtain fuzzy regular treelanguages by substitution, concatenation and closure operation．Finally, we introduce the notion of fuzzyregular tree expressions and the equivalences between fuzzy regular tree expressions and fuzzy treeautomata are proved．...