• Title/Summary/Keyword: SCOTT

Search Result 528, Processing Time 0.04 seconds

POSSIBLE EDGES OF A FINITE AUTOMATON DEFINING A GIVEN REGULAR LANGUAGE

  • Melnikov, B.F.;Sciarini Guryanova, N.V.
    • Journal of applied mathematics & informatics
    • /
    • v.9 no.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.

A NEW ALGORITHM OF THE STATE-MINIMIZATION FOR THE NONDETERMINISTIC FINITE AUTOMATA

  • Melnikov, B.F.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.2
    • /
    • pp.379-392
    • /
    • 1999
  • The problem of the state-minimization for the nonde-terministic finite Rabin-Scott's automata is considered. A new algo-rithm for this problem is obtained. The obtained algorithm has the exponential effectiveness like the earlier-known algorithms for this problem. But each of previous algo-rithms amounts to the search of minimum generative system for local reaction of equal automaton of canonical form and unlike them we use in this paper two special function marking states of the given automaton.

Harmonics analysis based on a frequency domain in Electric Feeding System (전기철도 급전시스템의 주파수 기반모델을 이용한 고조파 해석)

  • Han Moonseob;Lee Jangmu;Jung Hosung;Kim Joorak
    • Proceedings of the KSR Conference
    • /
    • 2004.06a
    • /
    • pp.1315-1318
    • /
    • 2004
  • Each feeding power is transformed 3 phases of KEPCO through SCOTT transformer and operate a electric train in AC Feeding system of electric railway. Nowaday a power conversion system, installed inside the train, generate a harmonics and has a effect on a power quality and it is necessary to install a countermeasures. This report is proposed a new technique to simulate a power system based on frequency model. The result is resonable relatively with a experimental one.

  • PDF

Single Phase to 3 Phase Conversion Using Cyclo-Converter (Cycloconverter를 이용한 단상-3상 변환에 관한 연구)

  • 박민호;전상대
    • 전기의세계
    • /
    • v.28 no.3
    • /
    • pp.51-56
    • /
    • 1979
  • The purpose of this paper is to study the conversion of single phase to three phase. In the proceeding of phase conversion, it is very convinence to convert two-phase from single phase using cycloconverter before and then two to three phase by scott connection transformer. There are also systematized zero-crossing, mono vibrator and ring counter circuit for the gate trigger circuits of cycloconverter. The wave forms of three phase by experimental results are analyzed and discussed the relation of phase difference among them.

  • PDF

THE BASIS AUTOMATON FOR THE GIVEN REGULAR LANGUAGE

  • Vakhitova, A.A.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.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.

EDGE-MINIMIZATION OF NON-DETERMINISTIC FINITE AUTOMATA

  • Melnikov, B.F.;Melnikova, A.A.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.3
    • /
    • pp.693-703
    • /
    • 2001
  • In this paper we consider non-deterministic finite Rabin-Scott’s automata. We use a special structure to descibe all the possible edges of non-determinstic finite automaton defining the given regular language. Such structure can be used for solving various problems of finite automata theory. One of these problems is edge-minimization of non-deterministic automata. As we have not touched this problem before, we obtain here two versions of the algorithm for solving this problem to continue previous series of articles.

Comparative Analysis of Centralized Vs. Distributed Locality-based Repository over IoT-Enabled Big Data in Smart Grid Environment

  • Siddiqui, Isma Farah;Abbas, Asad;Lee, Scott Uk-Jin
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2017.01a
    • /
    • pp.75-78
    • /
    • 2017
  • This paper compares operational and network analysis of centralized and distributed repository for big data solutions in the IoT enabled Smart Grid environment. The comparative analysis clearly depicts that centralize repository consumes less memory consumption while distributed locality-based repository reduce network complexity issues than centralize repository in state-of-the-art Big Data Solution.

  • PDF

Continuous Flames and Countably Approximating Frames

  • 이승온
    • Journal for History of Mathematics
    • /
    • v.13 no.2
    • /
    • pp.95-104
    • /
    • 2000
  • This paper is a sequel to [24]. It is well known that the order structure plays the important role in the study of various mathematical structures. In 1972, Scott has introduced a concept of continuous lattices and has shown the equivalence between continuous lattices and injective $T_0-spaces$. There have been many efforts made to generalize continuous lattices and extend corresponding properties to them. We introduce another class of frames, namely countably approximating frames, generalizing continuous frames and study its basic properties.

  • PDF

LOWER FORMATION RADICAL FOR NEAR RINGS

  • Saxena, P.K.;Bhandari, M.C.
    • Kyungpook Mathematical Journal
    • /
    • v.18 no.1
    • /
    • pp.23-29
    • /
    • 1978
  • In [7) Scott has defined C-formation radical for a class C of near rings and has studied its porperties under chain conditions. A natural question that arises is: Does there exist a Lower C-Formation radical class L(M) containing a given class M of ideals of near rings in C? In this paper we answer this by giving. two constructions for L(M) and prove that prime radical is hereditary.

  • PDF