• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.1009-1019
• /
• 2001

We introduce the concepts of TL-finite state machine, TL-kernel and TL-subfinite state machines, TL-kernel and TL-subfinite state machine and obtain some results concerning them.

• 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 Digital Contents Society
• /
• v.7 no.1
• /
• pp.35-40
• /
• 2006

Game AI(Artificial Intelligence) technologies implement the movement of autonomous characters and control the movement of Non-Player Characters(NPC). In this paper, we present several types of game AI control systems such as Movement Scripts, FSM(Finite State Machines), Hierarchical State Machines, fuzzy State Machines, and Pathfinding techniques and their limitations.

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

• 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 Korea Multimedia Society
• /
• v.16 no.1
• /
• pp.75-86
• /
• 2013

This paper presents a technique to implement embedded systems using interrupts of the one-chip microcontroller with many peripherals based on a multiple finite state machines model. The multiple finite state machine model utilizes the structure of FSMD used for hardware design and the features of flow control by interrupts. The main finite state machine corresponds to the main program and the sub-state machines corresponds to the interrupt subroutines. Therefore, interrupts from the peripherals can be processed immediately in the sub-state machines. The request and reply variables are used to interface between the finite state machines. Additional operating system is not necessary for the context switching between the main state machine and the sub-state machine, because the flow-control caused by interrupt can be replaced with the switching. An embedded system modeled on multiple finite state machine with ASM charts can be easily implemented by the conversion of ASM charts into C-language programs. This implementation technique can be easily adopted to the hardware oriented embedded systems because of the detail description of the model and the fast response to the interrupt events in the sub-state machine.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.4
• /
• pp.78-81
• /
• 1998

We introduce the concepts of coverings, direct products, cascade products and wreath products of fuzzy finite state machines and investigate their algebraic structures.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.880-883
• /
• 2005

This paper presents a method of constructing the sequential logic machines over finite fields(or galois fields). The proposed the sequential logic machines is constructed by as following. First of all, we obtain the linear characteristics between present state and next state based on mathematical properties of finite fields and sequential logic machines. Next, we realize the sequential logic machines over finite field GF(P) using above linear characteristics and characteristic polynomial that expressed using by matrix.

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