The Cartesian composition of fuzzy finite state machines
暂无分享,去创建一个
Studies the concept of the Cartesian composition of fuzzy finite state machines. Shows that fuzzy finite state machines and their Cartesian composition share many structural properties. Some of these properties are singly generated; retrievability, connectedness, strong connectedness, commutativity, perfection and state independence. Thus a fuzzy finite state machine which is a Cartesian composition of submachines can be studied in terms of smaller machines.
[1] D. Buchsbaum,et al. Commutative Algebra, Vol. II. , 1959 .
[2] Lotfi A. Zadeh,et al. Fuzzy Sets , 1996, Inf. Control..
[3] W. Wee. On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification , 1967 .
[4] Abraham Kandel,et al. Fuzzy Switching and Automata: Theory and Applications , 1979 .