• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1136-1140
• /
• 2010

Esterel is an imperative synchronous language and its formal semantic based on finite state machine makes it easy to perform program analyses using automata. In this paper, we propose a syntax-driven automata generation rule. Because our rule intuitively expresses syntactic structure, it is very useful for other program analyses.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.117-134
• /
• 1997

In this paper we introduce the notions of TL-subsystems strong TL-subsystems and discuss their basic properties.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.52-59
• /
• 2002

This paper introduces FSM, statistical FSM and NFA that are used for assigning behaviors of NPCs in computer games. We propose a new method for remedy of the weakness of previous studies. We use the method of inferencing stochastic grammars to generate NPCs behaviors. Using this method we can generate a lot of MPCs or Computer Players behaviors automatically and the games will be more enjoyable.

• Journal of The Korean Association of Information Education
• /
• v.20 no.4
• /
• pp.401-408
• /
• 2016

CS Unplugged education is emphasized as the component of the basic principles of Elementary SW education. This document produced by two other Timbell presents the contents in a variety of topics about computer science. One of the main components is the finite Automata, and this requires the development of educational materials for teaching our situation. So We'll present the finite Automata learning materials for elementary school classes. Learning model that we have presented is a process of self-directed and activity-based learning. For verification of this experiment was the validation of the expert group and was concluded that adequate through the analysis of the diagnostic tests.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1234-1239
• /
• 1990

In this paper, we propose a new type of decentralized learning automata for the control finite state Markov chains with unknown transition probabilities and rewards. In our scheme a .betha.-type learning automaton is associated with each state in which two or more actions(desisions) are available. In this decentralized learning automata system, each learning automaton operates, requiring only local information, to improve its performance under local environment. From simulation results, it is shown that the decentralized learning automata will converge to the optimal policy that produces the most highly total expected reward with discounting in all initiall states.

• Journal of KSNVE
• /
• v.10 no.4
• /
• pp.610-614
• /
• 2000

Cellular Automata(CA)s are used as a simple mathematical model to investigate self-organization in statistical mechanics, which are originally introduced by von Neumann and S. Ulam at the end of the 1940s. CAs provide a framework for a large class of discrete models with homogeneous interactions, which are characterized by the following fundamental properties: 1) CAs are dynamical systems in which space and time are discrete. 2) The systems consist of a regular grid of cells. 3) Each cell is characterized by a state taken from a finite set of states and updated synchronously in discrete time steps according to a local, identical interaction rule. 4) The state of a cell is determined by the previous states of a surrounding neighborhood of cells. A cellular automaton has been attracted wide interest in modeling physical phenomena, which are described generally, partial differential equations such as diffusion and wave propagation. This paper describes one and two-dimensional analysis of wave propagation phenomena modeled by CA, where the local interaction rules were derived referring to the Lattice Gas Model reported by Chen et al., and also including finite difference scheme. Modeling processes by using CA are discussed and the simulation results of wave propagation with one wave source are compared with that by finite difference method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.752-757
• /
• 2000

The recursive formulae, which can self-reproduce the state transition graphs, of one-dimensional cellular automata rule 15 with two states (0 and 1) and four different boundary conditions were founded by categorical access. The categorical access makes the evolution process for cellular automata be expressed easily since it enables the mapping of automata between different domains.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.2
• /
• pp.94-102
• /
• 2011

In this paper, a novel drowsiness detection algorithm using eye-blink pattern is proposed. The proposed drowsiness detection model using finite automata makes it easy to detect eye-blink, drowsiness and sleep by checking the number of input symbols standing for closed eye state only. Also it increases the accuracy by taking vertical projection histogram after locating the eye region using the feature of horizontal projection histogram, and minimizes the external effects such as eyebrows or black-framed glasses. Experimental results in eye-blinks detection using the JZU eye-blink database show that our approach achieves more than 93% precision and high performance.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.503-503
• /
• 1995

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.96-104
• /
• 2011

Modeling and simulation of human-involved complex systems pose challenges to representing human decision makings into logical systems because of the nondeterministic and dynamic nature of human behaviors. In modeling perspectives, human's activities in systems can increase uncertainty and complexity, because he or she can potentially access all other resources within the system and change the system states. To address all of these human involvements in the system, this research suggests applying the Finite State Automata (FSA)-based formal modeling of human-involved systems that incorporates the ecological concept of affordances to an evacuation simulation, so that human behavioral patterns under urgent and dynamic emergency situations can be considered in the real-time simulation. The proposed simulation methodologies were interpreted using the warehouse fire evacuation simulation to clarify the applicability of the proposed methodology. This research is expected to merge system engineering technologies and human factors, and come out to the new predictive modeling methodology for disaster simulations. This research can be applied to a variety of applications such as building layout designs and building access control systems for emergency situations.