• 제목/요약/키워드: Free automata

검색결과 12건 처리시간 0.025초

MODULE-LIKE PROPERTIES ON FREE AUTOMATA

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • 제7권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.

SOME REMARKS ON THE STRUCTURE OF FREE AUTOMATA

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • 제6권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.

ON THE FREE AUTOMATA AND TENSOR PRODUCT

  • Park, Chin-Hong
    • 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.

ON FREE AND TORSION-FREE AUTOMATA

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • 제1권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

SOME REMARKS ON IRREDUCIBLE AUTOMATA AND PRIMITIVE SEMIGROUPS ASSOCIATED WITH THEM

  • Park, Chin-Hong;Shim, Hong-Tae
    • Journal of applied mathematics & informatics
    • /
    • 제14권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.

사고로 인한 유해화학물질 누출확산의 대응을 위한 Cellular Automata기반의 시뮬레이션 시스템 (Cellular Automata Simulation System for Emergency Response to the Dispersion of Accidental Chemical Releases)

  • 폴신;김창완;곽동호;윤인섭;김태옥
    • 한국가스학회지
    • /
    • 제22권6호
    • /
    • pp.136-143
    • /
    • 2018
  • Cellular automata는 천체물리, 사회현상, 화재 확산 및 피난 등 많은 분야의 시뮬레이션에 활용되고 있다. 본 연구는 빈번히 발생하고 있는 화학사고에 대비한, 위험성평가 및 비상대응계획 작성시 요구되는 화학물질 확산 시뮬레이션을 위한 보급용 모델을 cellular automata를 기반으로 개발하였다. 상세한 플랜트 안전설계용과는 달리, 실시간 사고대응을 위해선 빠른 계산과 더불어 피해영역 분포의 불확실성을 줄이기 위한 반복 계산이 요구된다. EPA ALOHA, 화학물질안전원 KORA 등이 있지만, 지속적인 모델과 코드의 보완이 가능하고, 중소기업용의 무료 S/W개발에 본 연구의 차별성이 있다. 계산시간이 많이 요구되는 full-scale CFD에 비해 상대적인 정확도의 손실은 감수하고, 특히 일반 사용자의 편리성을 도모하였다. 기상청 기상정보 연계를 비롯해, Python open-source 라이브러리들을 활용해, 기능 확장 및 지속적인 update가 가능하며, 사용자는 해당 플랜트의 지형도와 사용 물질의 입력만으로 쉽게 결과를 얻을 수 있다. Full-scale CFD 시뮬레이션과 대비해 정확도를 확인하였으며, 빠른 계산을 위해 GPU를 활용하는 open source software로 배포될 예정이다.

Modeling and Stimulating Node Cooperation in Wireless Ad Hoc Networks

  • Arghavani, Abbas;Arghavani, Mahdi;Sargazi, Abolfazl;Ahmadi, Mahmood
    • ETRI Journal
    • /
    • 제37권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).

셀룰라 오토마타를 이용한 김해시의 도시성장모형에 관한 연구 - 1987~2001년을 중심으로 - (A study on the Urban Growth Model of Gimhae City Using Cellular Automata)

  • 이성호;윤정미;서경천;남광우;박상철
    • 한국지리정보학회지
    • /
    • 제7권3호
    • /
    • pp.118-125
    • /
    • 2004
  • 본 논문은 향후 도시의 물리적 성장형태를 예측하고자 하는 일련의 연구로서 김해의 과거 도시 성장과정을 분석함으로써 김해지역에 적합한 셀룰라 오토마타의 네이버후드 및 전이규칙을 결정하는 것을 목적으로 한다. 동적모델과 시간에 따른 변화를 다룰 수 있는 셀룰라 오토마타를 도입하여 1987년부터 2001년까지 김해지역의 도시성장을 분석하였으며, 다양한 네이버후드와 전이규칙의 시뮬레이션을 통해 김해지역에 적합한 네이버후드와 전이규칙을 정립하였다. 결론으로 김해지역은 네이버후드의 행렬이 작을수록, 또한 동일한 거리를 가진 circle 형태보다 정사각형의 네이버후드가 적합하였고, 도시성장속도를 조절하는 ${\alpha}$값이 작을수록, 그리고 전환가능성 ($P_{ij}$) 이 클수록 적합한 것으로 나타났다.

  • PDF

CFG 방법을 이용한 필기체 한글에서의 자소추출과 인식에 관한 연구 (A Study on Phoneme Extractions and Recognitions for Handwritten Korean Characters using Context-Free Grammar)

  • 김형래;박인갑;서동필;김에녹
    • 전자공학회논문지B
    • /
    • 제29B권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.

  • PDF

SOME REMARKS ON S-SYSTEMS AND RADICAL ASSOCIATED WITH A SEMIGROUP S

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • 제9권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.