• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.155-165
• /
• 2007

We consider a possible generalization of nondeterministic finite automata. The goals of this consideration are: to apply some obtained algorithms for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; to simplify some proofs for algorithms of simplification for usual nondeterministic automata.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1079-1084
• /
• 2016

Single-state parsing automata have a characteristic such that the decision of an action depends only on the current state but not on the parsing history. The memory space and the parsing time of single-state parsing automata are less than the memory space and the parsing time of LR automata. However, the applicable grammar class of single-state parsing automata is less than that of LR automata. This paper provides extended single-state parsing automata, which are applicable to LR grammars. In the prior work, the special state, referred to as the cyclic state was not treated in the construction of single-state parsing automata, and hence, the applicable grammar class was less than LR grammars. The paper solves the problem of cyclic states by processing dynamic information depending on an input string. The proposed method expands the application of grammar class of single-state parsing automata to LR grammars.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.4
• /
• pp.311-314
• /
• 2001

Recently, research on Intelligent Information Process has actively been under way JD various areas and gradually extended to be adaptive to uncertain and complex dynamic environments. This paper presents a Multiple Valued Logic Automata(MVL-Automata) Model, utilizing properties of difference in a Multiple Valued Logic function. That is, MVL-Automata is able to be autonomously adapted to dynamic changing since an input stling is mapped to the value of a Multiple Valued Logic function and the property of difference in a Multiple Valued Logic function is applied to state transition. Therefore, Multiple Valued Logic Automata can be widely applied to the modeling dynamically of changing environments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.8
• /
• pp.701-708
• /
• 2001

Recently, the research on intelligence of computer has actively been under way in various areas and gradually extended to adapt to uncertain and complex environments. In this paper, we propose the MVL-Neural Valued Logic. Also, we verify that the MVL-Automata can be implemented to Neural Network and the MVL-Neural Network Model can be a simulator by MVL-Automata. Therefore, we propose that the MVL-Neural Network Model can be widely used in such area, as intelligent system or modeling of brain. In particular, the MVL-Neural Network is expected to be used as core technology of next generation computer.

• Journal of KIISE:Software and Applications
• /
• v.41 no.7
• /
• pp.518-522
• /
• 2014

A single state parsing automaton has the characteristics of the decision of actions which do not depend on the history of the parsing paths but on the current state. The single state parsing automaton hence has the advantage of the reduced parsing time and a small memory requirement compared to those of the conventional LR automaton. However, currently, the grammar classes generating single state parsing automata have not been known. This paper deals with the grammar classes generating single state parsing automata; in addition, this paper gives the generating method of single state parsing automata of the grammar classes.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.367-376
• /
• 2002

XML allows users to define elements using arbitrary words and organize them in a nested structure. These features of XML offer both challenges and opportunities in information retrieval and document management. In this paper, we propose a new methodology for computing similarity considering XML semantics - meanings of the elements and nested structures of XML documents. We generate extended-element vectors, using thesaurus, to normalize synonyms, compound words, and abbreviations and build similarity matrix using them. And then we compute similarity between XML elements. We also discover and minimize XML structure using automata(NFA(Nondeterministic Finite Automata) and DFA(Deterministic Finite automata). We compute similarity between XML structures using similarity matrix between elements and minimized XML structures. Our methodology considering XML semantics shows 100% accuracy in identifying the category of real documents from on-line bookstore.

• Journal of the Korean Geographical Society
• /
• v.43 no.1
• /
• pp.117-133
• /
• 2008

Although development density control has received murk attention in urban planning, there has been little research on empirical methods that can examine local changes in development density. Recently, attempts have been made to develop cellular automata (CA) models that can be applied to urban landuse change. This paper aims to develop an extended landuse change model based on urban CA considering development density. The proposed model not only includes density control component in a model framework, but also directly estimates local density changes in land use. The developed model was applied to the study area, which was a part of central Seoul. The calibration of the model was carried out over the period $1900s\sim2000s$ using parcel-based land use data and related variables The results of the calibrated model have been tested by comparison with actual landuse data, and have demonstrated that the developed model can produce realistic simulations of urban landuse changes. But model output is dependent on the spacio-temporal resolution of input data. Further research is necessary to improve the calibration procedure and methods for evaluating model validity.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.44 no.5
• /
• pp.67-78
• /
• 2002

The purpose of this study is to apply land use planning model (LUPM) to a test village. The LUPM was tested to Uhang village, Ucheon-myeon, Gangwon-do, and its parameters calibrated by land use data from 1973 to 1980. When two test cases were considered of its extended built areas of 10,600㎡ from 1980 to 1985 and 51,300㎡ from 1985 to 1992, there was good similarities between simulated and observed results with R$^2$ being more than 0.95. Land use transfer patterns to residential use could be very similarly simulated from LUPM when comparing the observed patterns, so, LUPM can be applied to the comprehensive simulation of land use change due to the village growth.

• Honam Mathematical Journal
• /
• v.41 no.4
• /
• pp.837-849
• /
• 2019

Extended elementary cellular automata (EECA) is used to analyze the pattern of genetically modified (GM) gene dispersion to wild genes. Pollination of GM maize mainly occurs by wind. Wind direction was set to two directions left to right and up to down on the cells. Sixteen cases were analyzed to show six kinds of classes of pattern for sixteen iterations. Wind directions were fixed for the simulations to see the effect of the GM maize dispersion by the wind.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.467-474
• /
• 2001

When user wants to animate more than one character, some unexpected motion animation like a collision between characters may occur. Therefore, this problem must be resolved using a proper control mechanism. Therefore, this problem must be resolved using a proper control mechanism. This paper proposes an agent-based system that controls the motion animation of the character for representing animation scenario reflecting user\`s intention. This system provides a method that coordinates a type of motion and avoids collision between characters according to the moving path of a character in three-dimensional space. Agent communicates with others for motion synchronization. Agent is extended into several intelligent agents that coordinate character\`s motion. Agent system enables not only an intended motion animation, but also the scheduling of motion to an entire character animation. It designs automata model using Petri-net analysis tool for the agent\`s interaction as a method that passes the agent\`s information and infers the current state of agents. We implement this agent system to control the motion of character using agent technology and show an example of controlling the motion of human character model to prove the possiblity of motion control.