• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.21-32
• /
• 2000

We study theoretical aspects of one-dimensional cellular automata over GF(q), where q is a power of a prime. Some results about the characteristic polynomials of such cellular automata are given. Intermediate boundary cellular automata are defined and related to the more common null boundary cellular automata.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.2
• /
• pp.93-98
• /
• 2008

In this study, analyzed principle about stream cipher that is formed to Cellular Automata foundation. Cellular Automata can embody complicated and various principle with simple identifying marks that is State, Neighborhood, Transition Rules originally. Cellular Automata is hinting that can handle encipherment smoothly using transition rule. Create binary pad (key stream) by Cellular Automata's transition rule 30 applications in treatise that see therefore, and experimented ability of encryption and decryption because using stream cipher of symmetric key encryption way of password classification.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.1-8
• /
• 2001

We show that all automata in a. certain natural class satisfy three semisimplicity properties and describe all languages recognized by these automata.

• 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 the Korea Computer Industry Society
• /
• v.9 no.1
• /
• pp.29-38
• /
• 2008

This treatise analyzed theoretical principle of Cellular Automata systematically. Specially, Cellular Automata is hinting that can handle function of various form using transition rule. Cellular Automata can embody various and complicated principle with simple identifying marks that is "State", "Neighborhood", "Program Rules". Specially, have eminent cognitive faculty in image processing field. Examined closely that the ability excels flying important Edge Detection in image processing using this Cellular Automata in treatise that see therefore.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.327-335
• /
• 2003

Cellular Automata is discrete dynamical systems which natural phenomena may be specified completely in terms of local relation. In this Paper we Propose noise removal and edge detection algorithm using a Potts Automata which is based on Cellular Automata. The proposed method is aimed to locally increase or decrease the differences in gray level values between pixel of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is determined by Lyapunov operators for sequential and parallel update. We have found that proposed automata rules Present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuses the advantage and efficiency.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.357-377
• /
• 2000

A parallel communicating automata system is an accepting device based on the communications between more automata working in parallel. It consists of several automata corking independently but communicating with each other by request. We survey several variants of parallel communicating automata systems with respect to their computational power. Other aspects like decidability and complexity matters are also briefly discussed. Some open problem sand directions for future research are finally pointed out.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.81-84
• /
• 2000

Cellular automata are discrete dynamical systems whose behaviour is completely specified in terms of a local relation. If cellular automata convergence to fixed points, then it can be used to image processing. From the generalized Potts automata point of view, we propose in this paper a cellular automata technique for reducing image noise. To minimize blurring effect, an algorithm based on neighborhood median computation is Preferred. Experimental results are reported.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.1
• /
• pp.1-10
• /
• 2001

We investigate the relationship between the 0-tree and other trees in linear nongroup cellular automata. And we show that given a 0-basic path of 0-tree and a nonzero attractor ${\alpha}$ of a multiple attractor linear cellulara automata with two predecessor we construct an ${\alpha}$-tree of that multiple attractor linear cellular automata.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.433-443
• /
• 2006

In [1], they build two populations' cellular automata model with predation based on the Penna model. In this paper, uncertain aspects and problems of imprecise and vague data are considered in this model. A fuzzy cellular automata model containing movable wolves and sheep has been built. The results show that the fuzzy cellular automata can simulate the classical CA model and can deal with imprecise and vague data.