• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.347-355
• /
• 2000

In this paper we define linearly independent, basis, free, torsion-free and torsion-free completely on an automation. We prove a theorem describing a relationship between free and torsion-free completely on automata. Also we prove some important properties of them. Furthermore, we discuss some theorems associated with free.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.217-226
• /
• 1999

In this paper we define automata-linearly independence. An automaton M has a basis B iff M is free provided that we assume that the action of S on X $\times$ S is (x,sa) for all a, s $\in$ S and x $\in$ X. if a semigroup S is PRID every subautomaton of a free S-automaton is free.

• 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.1 no.1
• /
• pp.75-78
• /
• 1994

In this paper we define free torsion-free and torsion-free completely on an automaton. We prove some properties of them which are important

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.485-491
• /
• 2004

We shall discuss irreducible and primitive S-automata. A variety of properties of transitive and primitive semigroups associated with them have been obtained. Also a classification of primitive semi groups will be given with S-automata.

• Journal of the Korean Institute of Gas
• /
• v.22 no.6
• /
• pp.136-143
• /
• 2018

Cellular automata have been applied to simulations in many fields such as astrophysics, social phenomena, fire spread, and evacuation. Using cellular automata, this study develops a model for consequence analysis of the dispersion of hazardous chemicals, which is required for risk assessments of and emergency responses for frequent chemical accidents. Unlike in cases of detailed plant safety design, real-time accident responses require fast and iterative calculations to reduce the uncertainty of the distribution of damage within the affected area. EPA ALOHA and KORA of National Institute of Chemical Safety have been popular choices for these analyses. However, this study proposes an initiative to supplement the model and code continuously and is different in its development of free software, specialized for small and medium enterprises. Compared to the full-scale computational fluid dynamics (CFD), which requires large amounts of computation time, the relative accuracy loss is compromised, and the convenience of the general user is improved. Using Python open-source libraries as well as meteorological information linkage, it is made possible to expand and update the functions continuously. Users can easily obtain the results by simply inputting the layout of the plant and the materials used. Accuracy is verified against full-scale CFD simulations, and it will be distributed as open source software, supporting GPU-accelerated computing for fast computation.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.77-87
• /
• 2015

In wireless networks, cooperation is necessary for many protocols, such as routing, clock synchronization, and security. It is known that cooperator nodes suffer greatly from problems such as increasing energy consumption. Therefore, rational nodes have no incentive to cooperatively forward traffic for others. A rational node is different from a malicious node. It is a node that makes the best decision in each state (cooperate or non-cooperate). In this paper, game theory is used to analyze the cooperation between nodes. An evolutionary game has been investigated using two nodes, and their strategies have been compared to find the best one. Subsequently, two approaches, one based on a genetic algorithm (GA) and the other on learning automata (LA), are presented to incite nodes for cooperating in a noisy environment. As you will see later, the GA strategy is able to disable the effect of noise by using a big enough chromosome; however, it cannot persuade nodes to cooperate in a noisefree environment. Unlike the GA strategy, the LA strategy shows good results in a noise-free environment because it has good agreement in cooperation-based strategies in both types of environment (noise-free and noisy).

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.3
• /
• pp.118-125
• /
• 2004

The purpose of this study is to decide an appropriate neighborhood and a transition rule of cellular automata by analyzing the past growth process of urban areas in Gimhae. With cellular automata which can manage the change based on the dynamic model and time, this study analyzes the urban growth of Gimhae from 1987 to 2001. Also, through the simulation of different types for neighborhood and transition rules, we can find the appropriate neighborhood and the transition rule for Gimhae. In conclusion, the forecast of physical urban growth pattern is more accurate under conditions when the number of matrixes for the neighborhood is small, the shape of the neighborhood is rectangular, "${\alpha}$" value, which control the pace of urban growth, is low and the transition possibility ($P_{ij}$) is high.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.9
• /
• pp.8-16
• /
• 1992

This paper presents a method which can recognized the Handwritten Korean characters by using a Context-Free Grammar. The input characters are thinned in order to dwindle the mount of data, the thinned characters are converted into one-dimension strings according to six-forms. when the point of contact among phonemes is found, two phonemes are seperated respectively by marking the index mark (\) at the points. The Context-Free Grammar to input characters is classified into group grammars concerning the similarity of phonemes, input characters are parsed by making use of the Pushdown automata method. As the bent parts in the Handwritten characters are found frequently, We try to correct the bent parts by using the parsing distance measure, which recognize characters according to minium value caused by measuring the weight distance between two sentences. In this experiment, the recognition rate shows 93.8% to 275 Handwritten Korean characters.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.449-458
• /
• 2002

We shall give a gereralization for a new right congruence induced by right congruences on S and right ideals of S and discuss the radicals associated with automata. Also we shall discuss the relationship between the collection of all right ideals in S and the collection of all right congruences on S.