• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.749-753
• /
• 2003

In this paper we introduce the concepts on retrievability, separability and connectedness of fuzzy submachines, which generalize those of crisp submachines. And also we generalize crisp primary submachines to those with fuzziness, from which we obtain the decomposition theorem of fuzzy submachines.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.109-120
• /
• 2005

Using the notion of intuitionistic fuzzy sets, the concepts of intuitionistic fuzzy finite state machines (iffsm), intuitionistic successor s, intuitionistic subsystems, intuitionistic submachines, intuitionistic q-twins, and intuitionistic retrievable iffsm are introduce d, and related properties are studied. Relations between intuitionistic q-twins and intuitionistic q-related iffsm are given. A characterization of an intuitionistic retrievable iffsm is provided.