• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• 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.

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

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.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.

• Annual Conference of KIPS
• /
• 2001.10a
• /
• 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
• /
• v.17 no.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
• /
• v.9 no.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
• /
• v.6 no.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
• /
• v.8 no.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
• /
• v.16 no.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
• /
• v.16 no.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.