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

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.212-217
• /
• 1992

In this paper, a two ports machine(TPM) model for discrete event dynamic systems(DEDS) is proposed. The proposed model is a finite state machine which has two inputs and two outputs. Inputs and outputs have two components, events and informations. TPM is different from other state machine models, since TPM has symmetric input and output. This symmetry enables the block diagram representation of the DEDS with TPM blocks, summing points, multiplying points, branch points, and connections. The graphical representation of DEDS is analogous to that of control system theory. TPM has a matrix representation of its transition and information map. This matrix representation simplifies the analysis of the DEDS.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.1-10
• /
• 1996

In this paper we introduce the notions of a TL-finite state machine, TL-retrievability, TL-separability, TL-connectivity and dis-cuss their basic properties.

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

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.78-81
• /
• 1995

In this paper we introduce the notions of a TL-finite state machine, TL-retrievability, TL-separability, TL-connectivity and discuss their basic properties.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.7
• /
• pp.85-91
• /
• 2016

Typically, radar systems change the pulse repetition interval of their modulated signal in order to avoid detection. On the other hand the radar-signal detection system tries to detect the modulation pattern. The histogram or auto-correlation methods are usually used to detect the PRI pattern of the radar signal. However these methods tend to lost the sequence information of the PRI pulses. This paper proposes a PRI-sequence detection algorithm based on the finite-state machine that could detect not only the PRI pattern but also their sequence.

• Journal of Korea Game Society
• /
• v.10 no.3
• /
• pp.93-102
• /
• 2010

This paper is to design and implement the system to simulate spontaneously the group behaviors for the various states of doves. To do this, the group behaviors of doves were divided into the four action models such as 'Flying', 'Landing', 'Eating' and 'Taking off'. The steering forces composing of each action model were found and each action model was designed by using the finite state machine. The designed system was implemented by integrating the Ogre engine. From the simulations of the implemented system, the values of the parameters for the steering forces were found so that it can represent the spontaneous group behaviors of doves.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.113-118
• /
• 2024

In this study, we designed and analyzed two main structures for effectively implementing the behavior of intelligent NPCs the Hierarchical Finite State Machine (HFSM) and the Behavior Tree, by creating experimental games. The HFSM was found to be efficient for complex interaction-centered actions where state changes and transitions are crucial, while the Behavior Tree was effective in dynamic environments where ease of modification and expansion are required for dynamic responses under various conditions. These structures were experimentally applied using the Unity engine to verify their efficiency. This study focused on the basic structure design and plans to apply these structures to an upcoming action-adventure escape game. The results of this research are expected to assist game developers in efficiently implementing intelligent NPCs, thereby contributing to the improvement of game quality and player satisfaction.

• The Journal of the Acoustical Society of Korea
• /
• v.5 no.3
• /
• pp.50-57
• /
• 1986

유한상태 벡터양자화 방법을 이용한 격리단어인식에 관하여 기술하고 있다. 이 인식시스템은 codebook과 next-state function 으로 구성된 일종의 finite-state machine으로 볼 수 있다. 유한상태 벡 터양자화방법을 이용한 격리단어 인식시스템은 일반적인 벡터양자화방법을 이용한 인식시스템에 비하여 소요시간이 감소하며 입력음성을 분할할 필요도 없는 한편 두 시스템의 인식율은 비슷한 것으로 나타났 다. Next-state function을 구하는 방법에는 conditional histogram 방법과 omniscient design 방법이 있 으며, 이 방법들의 성능비교를 위해 영부터 구까지의 한국어 숫자음성에 대한 인식실험을 수행하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1572-1581
• /
• 1993

DFSM(Deterministic Finite State Machine) is used because it easily represents the control flow of a protocol in the protocol specification. Real protocols contain problem of nondeterminisms that have more than one enabled transition in the same state by same input. But DFSM does not process nondeterminism. So, in this paper, we first specify a protocol with NFSM (Nonderministic FSM) that may show the characteristics of nondeterminism, and propose an algorithm which converts NFSM to DFSM.