Abstract
Abstract
In this paper, we discuss some algebraic properties of Lattice valued finite state machine and prove that if there are homomorphic mapping satisfying certain conditions between two Lattice valued finite state machines, the first one is strongly connected (cycle), then then the second one is the same. And if the homomorphism is strongly homomorphic, one of the Lattice valued finite state machines is complete if and only if another Lattice valued finite state machine is complete. Discuss the completeness, strong connectivity, circulation and exchange capacity between the product of a Lattice valued finite state machine and the original Lattice valued finite state machine and get some results.
Subject
General Physics and Astronomy
Reference15 articles.
1. Submachines of fuzzy finite state machines;Malik,1994
2. Algebraic Fuzzy Automata Theory;Malik;The Arabian Joural for Science and Enginering,2000
3. On subsystems of a fuzzy finite state machines;Malik,1994
4. The cartesian composition of fuzzy finite state machines;Malik;Kybernetes,1995
5. Products of fuzzy finite state machine;Malik;Fuzzy sets and systems,1997