Lattice Minimal Automata and Lattice Reduced Automata
We apply lattice ordered monoids in the study of lattice finite automata, and obtain some results similar to the ones of fuzzy finite automata. In this paper, the concepts of lattice minimal automata and lattice reduced automata are put forward, and the relationship of them associated with an L-language is discussed. Moreover, the L-fuzzy equivalence relation on states is defined, and an algorithm to minimize the lattice finite automata is presented based on clustering states.
KeywordsLattice minimal automata Lattice reduced automata L-regular language L-fuzzy equivalence Clustering
Unable to display preview. Download preview PDF.
- 2.Wee, W.G.: On generalization of adaptive algorithm and application of the fuzzy sets concept to pattern classification. Ph. D. Thesis, Purdue University (1967)Google Scholar
- 3.Qiu, D.W.: Automata theory based on completed residuated lattice-valued logic(I). Science in China, Series F44 6, 419–429 (2001)Google Scholar
- 4.Qiu, D.W.: Automata theory based on completed residuated lattice-valued logic(II). Science in China, Series F45 6, 442–452 (2002)Google Scholar
- 8.Horng, M.S.: State minimization of fuzzy automaton, pp. 1946–1949. IEEE, Los Alamitos (1998)Google Scholar