• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.287-300
• /
• 2005

In this paper, we analyze Pseudo-Noise (PN) sequences generated by a maximum-length 90/150 Null Boundary Cellular Automata and we give the relationship among minimum offsets.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.2
• /
• pp.53-62
• /
• 2002

In this paper we analyze the behavior of linear multiple attractor cellular automata having two-predecessors.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.689-694
• /
• 2011

Cellular automata are discrete dynamical systems, which provide the basis for the synthesis of complex emergent behavior. This paper proposes a new algorithm of digital watermarking based on cellular automata transform (CAT). The idea of two-dimensional CAT is introduced into the algorithm. After the original image is disassembled with 2D CAT, the watermark information is embedded into the Middle-frequency of the carrier picture. Cellular automata have a huge number of combinations, such as gateway values, rule numbers, initial configuration, boundary condition, etc. Using CAT, the robustness of the watermark will be tremendous strengthened as well as its imperceptibility. Experimental results show that this algorithm can resist some usual attacks such as compression, sharpening and so on. The proposed method is robust to different attacks and is more security.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.255-258
• /
• 2001

This paper is implementation of cellular automata neural network system which is a living creatures' brain using evolving hardware concept. Cellular automata neural network system is based on the development and the evolution, in other words, it is modeled on the ontogeny and phylogeny of natural living things. The proposed system developes each cell's state in neural network by CA. And it regards code of CA rule as individual of genetic algorithm, and evolved by genetic algorithm. In this paper we implement this system using evolving hardware concept Evolving hardware is reconfigurable hardware whose configuration is under the control of an evolutionary algorithm. We design genetic algorithm process for evolutionary algorithm and cells in cellular automata neural network for the construction of reconfigurable system. The effectiveness of the proposed system is verified by applying it to time-series prediction.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1279-1281
• /
• 1999

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 to achieving a 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.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.585-596
• /
• 1998

Some new problems of the theory of the finite automata are considered. Applying the finite automata in various tasks of the formal languages theory is observed. Special proof of Kleene's theorem is obtained. This proof is used for the defining the star-height of the finite automaton. The proper-ties of the last object are considered. The star-height of the finite automaton is used for reformulating the star-height problem of regular expression for finite automata. The method of the reduction of the star-height problem to the task of making special finite automaton is obtained. This reformulating can help to solve the star-height problem by new way.

• Journal of Korea Multimedia Society
• /
• v.18 no.12
• /
• pp.1462-1467
• /
• 2015

Pixel values of original image can be changed by XORing pixel values of original image and pixel values of the basis image obtained by pseudo random sequences. This is a simple method for image encryption. This method is an effect method for easy hardware implementation and image encryption with high speed. In this paper we propose a method to obtain basis image with pseudo random sequences with large nonlinearity using nonlinear cellular automata and maximum length linear cellular automata. And experimental results showed that the proposed image encryption scheme has large key space and low correlation of adjacent cipher pixel values.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.571-583
• /
• 2004

In this paper we shall discuss the quasi-perfect automata associated with power automata. We shall give the fact that x(M)/ HX is normal subgroup of the characteristic semigroup x(M) if the automaton A is quasi-perfect and x(M)/HX = x$(M)_H$ if A is perfect. Moreover, it is a very interesting part that x$(M)_H$ is conjugate to x$(M)_{Ha}$ for every a $\in$ X. Also we shall give a characterization of Ha = Hb for x$(M)_H$.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.49-58
• /
• 2011

Owing to the spread of smart devices using touch screen, the Korean language (Hangul) input methods have been varied. In this paper, we have researched and analyzed for finding the best input way of Hangul, which is appropriate to smart devices. By using automata theory, we have suggested easy and efficient automata. The automata, which we suggested, can be used in a Hangul input of gesture type.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.4
• /
• pp.10-16
• /
• 1996

In this paper, we construct the state table of the automata according to input, state, and change of state and transform that state table into symbolic multi-valued logic formula. Also, we propose an adaptive automata which adapts dynamically change of state aqording to the input string of automata by using the properties of derivative about the symbolic multi-valued logic function. And we analyze the properties of the adaptive automata.