• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.313-315
• /
• 1993

This paper presents the control of input/output automata. The input/output automata provides an appropriate model for discrete event systems consisting of concurrently-operating components. Ramadge and Wonham's supervisor controller can be transformed into the controllter of input/output automata. Using input/output automata, the modelling can be more realistic and concurrent discrete event systems can be controlled easily.

• 정보과학회 논문지
• /
• 제43권10호
• /
• pp.1079-1084
• /
• 2016

단일상태파싱오토마톤은 구문 분석할 때 행동의 결정이 현재 상태로만 가능하다는 특징이 있고, LR오토마톤과 비교하여 상태수가 적고 구문 분석 시간이 단축된다는 장점이 있다. 한편 단일 상태파싱오토마톤은 적용 가능한 문법 클래스가 LR문법보다 작다는 단점이 있다. 본 논문에서는 단일상태파싱오토마톤을 LR문법 클래스에 적용 가능하도록 확장하는 방법을 제시한다. 기존 방법에서는 파싱오토마톤 생성 과정에서 싸이클릭 상태가 생성되는 경우에 대한 처리 방법을 제시하지 못하였다. 본 논문은 싸이클릭 상태에 대한 입력스트링에 따른 동적 처리 작업을 제시하여, 싸이클릭 상태에 대한 문제를 해결한다. 본 논문에서 확장한 방법은 모든 LR 문법에 대해 단일상태파싱오토마톤을 생성할 수 있게 한다.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권4호
• /
• pp.185-194
• /
• 2000

The learning automaton is an automaton to update systematically the strategy for enhancing the performance in response to the output results, and several schemes of learning automata have been presented. In this paper, S-model learning automata are applied in order to achieve the best compromise solution between an optimal solution for economic operation and an optimal solution for stable operation of the power system under the circumstance that the loads vary randomly. It is shown that learning automata are applied satisfactorily to the multiobjective optimization problem for obtaining the best tradeoff among the conflicting economy and stability objectives of power systems.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2001년도 추계학술발표논문집 (상)
• /
• pp.767-770
• /
• 2001

Edge detection is one of issues with essential importance in the area of image process. An edge in image is a boundary or contour which a significant change occurs in image intensity. In the paper, we process edge detection algorithms which are based on Potts automata. The dynamical behavior of these automata is completely determined by Lyapunov operators for sequential and parallel update. If Potts Automata convergence to fixed points, then it can be used to image processing. From the generalized Potts automata point of view, we propose a Potts Automata technique for detecting edge. Based on the experimental results we discuss the advantage and efficiency.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.663-670
• /
• 2005

In this paper we shall give some decompositions derived from cyclic subautomata or neighborhoods of the automaton. Also we shall discuss some characterizations of cyclic automata when an automaton is maximal cyclic refinement. If m $\in$ M is totally reachable state, we shall see that {$mX^{\ast}$} is minimal.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.705-716
• /
• 2002

In this paper we shall introduce the algebraic structure of a tensor product for arbitrarily given automata, giving a defintion of the tensor product for automata. We introduce and study that for any set X there always exists a free automaton on X. The existence of a tensor product for automata will be investigated in the same way like modules do.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.851-858
• /
• 1999

A new problem of the theory of finite automata (Rabin-Scott's automata) is considered. So called basis automaton for the given regular language l is defined. this automaton is unique for the given L, it is defined by two au-tomata of canonical form: for L and for its inverse language LR. Some properties of basis automata are considered. Such properties make these automata most convenient for using in some special tasks dealing with the given regular language.

• 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.559-569
• /
• 2004

In this paper we shall discuss the quasi-perfect automata associated with power automata. We shall give the fact that its power automaton is invertible if an automaton A is quasi-perfect. Moreover, some subgroups and normal subgroups of the characteristic semigroup X(M) will have the very interesting parts in their structures.

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

We shall discuss some properties of quasi-homomorphisms associated with automata. We shall give some characterizations in terms of characteristic semigroups for regular and invertible attomata.