• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.457-466
• /
• 2005

In this paper we present the concepts of fuzzy submachine, which are the generalized form of crisp submachine of a fuzzy finite state machine. Also we extend the concepts of system of generators to fuzzified form.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.315-325
• /
• 2006

The notion of intuitionistic fuzzy finite switchboard state machines and (strong) homomorphisms of intuitionistic fuzzy finite state machines are introduced, and related properties are investigated. After we give a congruence relation on the set of all words of elements of X of finite length, the quotient structure is discussed. We show that the family of equivalence classes is a finite semigroup with identity.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.2
• /
• pp.156-160
• /
• 2001

In this paper we define fuzzy subsystems of a fuzzy finite state machine by using maps $S^{\alpha}$ of each state subset to its all $\alpha$-successors, which is a natural generalization of crisp submachines as fuzzy. And the corresponding concepts are also examined. also examined.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.80-82
• /
• 1998

we introduce the concept of coverings, direct products, cascade products and wreath products of T-fuzzy finite state machines and investigate their algebraic structures.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.273-283
• /
• 2001

We introduce sums and joins of T-fuzzy transformation semi-groups and investigate their algebraic structures.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.53-61
• /
• 2001

We introduce sums and joins of fuzzy finite state machines and investigate their algebraic structures.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.2
• /
• pp.173-177
• /
• 2001

We introduce cascade products, wreath products, sums and joins of TL-finite state machines and investigate their algebraic structures. Also we study the relations with other products of TL-finite state machines.

• 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.25-28
• /
• 2001

We introduce sums and joins of fuzzy finite state machines and investigate their algebraic structures.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.553-561
• /
• 2007

In this paper we propose the concept of fuzzy basis of fuzzy submachine, which is the generalized form of crisp basis of submachine, and we extend the system of generators and free subset to fuzzy forms, from which we prove that minimal system of fuzzy generators, maximally free fuzzy subset, and fuzzy basis are equivalent forms.