• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제9권2호
• /
• pp.119-128
• /
• 2002

We here characterize semigroups (which are called completely right projective semigroups) for which every S-automaton is projective, and then examine some of the relationships with the semigroups (which are called completely right injective semigroups) in which every S-automaton is injective.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제35권11호
• /
• pp.701-704
• /
• 2008

일반 오토마톤은 다중 입력 전이를 허용하기에 과거 전이 경로가 필요한 경우에는 별도 작업이 필요하다. LR 오토마톤의 경우는 스택을 이용하여 과거 전이 경로를 저장한 후에 파싱 시에 이를 이용한다. 한편 과거 경로의 정보를 포함하도록 상태 구성이 가능한 경우에는 과거 정보 추적을 위한 오버헤드를 피할 수가 있다. 본 논문에서는 과거 전이에 의존하지 않는 단일 상태 파싱 오토마톤을 제안한다. 적용 가능한 문법 클래스는 LR 문법보다 작으나, 오토마톤의 상태가 과거 경로의 정보를 포함하기에 LR 오토마톤과 달리 파싱시에 과거 정보의 추적이 불필요하다.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.639-649
• /
• 2010

In this paper, a definition of interval-valued fuzzy regular language (IVFRL) is proposed and their related properties studied. A model of finite automaton (DFA and NDFA) with interval-valued fuzzy transitions is proposed. Acceptance of interval-valued fuzzy regular language by the finite automaton (DFA and NDFA) with interval-valued fuzzy transitions are examined. Moreover, a definition of finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states is proposed. Acceptance of interval-valued fuzzy regular language by the finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states are also discussed. It is observed that, the model finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states is more suitable than the model finite automaton (DFA and NDFA) with interval-valued fuzzy transitions for recognizing the interval-valued fuzzy regular language. In the end, interval-valued fuzzy regular expressions are defined. We can use the proposed interval-valued fuzzy regular expressions in lexical analysis.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.671-678
• /
• 2005

In this paper we shall give some characterizations of strongly cyclic and totally reachable (TR) automata when A = (M, X, $\delta$) is MinCR-automaton. Also we shall see that if an automaton A is strongly cyclic, then A is cyclic and a TR-automaton. When A is MinmaxCR-automaton, we shall give another characterizations for a strongly cyclic and cyclic TR-automaton.

• Journal of applied mathematics & informatics
• /
• 제6권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
• /
• 제27권1_2호
• /
• pp.409-417
• /
• 2009

A definition of finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is proposed. Acceptance of intuitionistic fuzzy regular language by the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states are examined. It is found that the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is more suitable for recognizing intuitionistic fuzzy regular language than earlier model. The paper also gives an idea of intuitionistic fuzzy regular expressions through possible definitions.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.645-655
• /
• 2002

In this Paper we consider non-deterministic finite Rabin-Scott's automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a non-deterministic automaton. We prove, that any edge of any non-deterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

• East Asian mathematical journal
• /
• 제27권1호
• /
• pp.67-73
• /
• 2011

We investigate some conditions for hybrid cellular automata to be group cellular automata.

• East Asian mathematical journal
• /
• 제25권4호
• /
• pp.517-525
• /
• 2009

We discuss group orders and lengths of cycles of state transition diagrams of cellular automata.