• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1986년도 하계학술대회논문집
• /
• pp.486-489
• /
• 1986

The transition diagram, as well as the regular expression, can be used as a formal description for a language acceptable by a finite automaton or for the behavior of a sequential switching circuit. But, if we are given one of these two descriptions, we shall find that it is not easy to get the other counterpart description. This paper is to show an easy method to find the equivalet regular expression from the transition diagram, by the aid of a graph-transformation technique.

• 한국정보처리학회논문지
• /
• 제6권11호
• /
• pp.2946-2953
• /
• 1999

Finite automation is a mathematical model to represent a system with discrete inputs and outputs. Finite automata are a useful tool for solving problems such as text editor, lexical analyzer, and switching circuit. In this paper, given a deterministic finite automaton of an input string of length n and m states, we propose a constant time parallel algorithm that represents the transition states of finite automata and determines the acceptance of an input string on a reconfigurable mesh of size [nm/2]$\times$2m.

• 대한수학회지
• /
• 제32권3호
• /
• pp.573-582
• /
• 1995

J.Milnor[Mi2] has introduced the notion of directional entropy in his study of Cellular Automata. Cellular Automaton map can be considered as a continuous map from a space $K^Z^n$ to itself which commute with the translation of the lattice $Z^n$. Since the space $K^Z^n$ is compact, map S is uniformly continuous. Hence S is a block map(a finite code)[He]. (S is said to have a finite memory.) In the case of n = 1, we have a shift map, T on $K^Z$, and a block map S and they together generate a $Z^2$ action.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(B)
• /
• pp.485-487
• /
• 2011

우리는 그래프 그리기를 위한 셀룰러 오토마타 모델을 제안한다. 셀룰러 오토마타는 간단한 전이 규칙들의 집합을 정의함으로써 비교적 복잡한 자연현상이나 사회현상을 재현해낼 수 있는 특징을 갖고 있다. 우리는 기존에 Eades가 제안했던 하중-기초 그래프 그리기 알고리즘을 기반으로 하여 육각형 격자상에서의 그래프 그리기를 위한 셀룰러 오토마타 모델을 제안한다. 제안된 모델은 기존의 알고리즘에 비해 더 효율적인 연산과정을 거치게 되며 보다 대칭적인 그래프를 그려준다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.89.6-89
• /
• 2001

In Vehicle Information and Communication System (VICS), which is an active field of Intelligent Transport System (ITS), information of traffic congestion is sent to each vehicle at real time. However, a centralized navigation system is not realistic to guide millions of vehicles in a megalopolis. Autonomous distributed systems should be more flexible and scalable, and also have a chance to focus on each vehicle´s demand. This paper proposes a sub-optimal route planning mechanism of vehicles in urban areas using the non-network type immune system. Simulation is carried out using a cellular automaton model. This system announces a sub-optimal route to drivers in real time using VICS.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.693-703
• /
• 2001

In this paper we consider non-deterministic finite Rabin-Scott’s automata. We use a special structure to descibe all the possible edges of non-determinstic finite automaton defining the given regular language. Such structure can be used for solving various problems of finite automata theory. One of these problems is edge-minimization of non-deterministic automata. As we have not touched this problem before, we obtain here two versions of the algorithm for solving this problem to continue previous series of articles.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.595-604
• /
• 2004

In this paper We shall give some characterizations for mX＊ derived from the relationships between S(m) and C(m). Also we shall discuss the minimal, maximal, strongly cyclic and minmaxCR-automata. There is an interesting part for the relationship between mX＊ and S(m). That is to say, that mX＊ is minimal has the same meaning as S(m) is strongly cyclic. We shall note that the minimality implies ‘ strongly cyclic’ and ‘strongly cyclic’ implies ‘cyclic’ and ‘cyclic’ implies ‘a MaxCR-automaton’.

• Journal of applied mathematics & informatics
• /
• 제24권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.1115-1118
• /
• 2000

In order to understand information of geographic information systems(GIS) exactly and easily, visualization technique becomes important. In this paper, we consider car-traffic which is one of the information accompanying with a map. Then, a visual simulation method is proposed for car-traffic flow at crossing with the cell-automaton and the ray tracing method. We simulate the various situations and discuss about changes of traffic.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1114-1117
• /
• 1993

The paper presents an effective method for finding the propagation structure of the real origin of a system malfunction. It uses a combined system model consisting of Structural Model (SM) in the form of Fuzzy Directed Graph and Behavior Model (BM) as a set of Fuzzy Relational Equations $A\;{\circ}\;R\;=\;B$. Here a specially proposed fuzzy inference technique is checked and investigated. Finally a test example for fault diagnosis of an industrial system is given and analyzed.