SOME PROPERTIES OF THE BASIS FINITE AUTOMATON

Melnikov, B.F.,Melnikova, A.A. 한국전산응용수학회 2002 The Korean journal of computational & applied math Vol.9 No.1

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.

FINANCIAL SYSTEM: INNOVATIONS AND PRINCING OF RISKS

Melnikov, A.V. Korean Mathematical Society 2001 대한수학회지 Vol.38 No.5

The paper studies the evolution of the financial markets and pays the basic attention to the role of financial innovations (derivative securities) in this process. A characterization of both complete and incomplete markets is given through an identification of the sets of contingent claims and terminal wealths of self-financing portfolios. the dynamics of the financial system is described as a movement of incomplete markets to a complete one when the volume of financial innovations is growing up and the spread tends to zero (the Merton financial innovation spiral). Namely in this context the paper deals with the problem of pricing risks in both field: finance and insurance.

POSSIBLE EDGES OF A FINITE AUTOMATON DEFINING A GIVEN REGULAR LANGUAGE

Melnikov, B.F.,Sciarini Guryanova, N.V. 한국전산응용수학회 2002 The Korean journal of computational & applied math Vol.9 No.2

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.

EDGE-MINIMIZATION OF NON-DETERMINISTIC FINITE AUTOMATA

Melnikov, B.F.,Melnikova, A.A. 한국전산응용수학회 2001 The Korean journal of computational & applied math Vol.8 No.3

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. AMS Mathematics Subject Classification : 68Q45

ONCE MORE ABOUT THE STATE-MINIMIZATION OF THE NONDETERMINISTIC FINITE AUTOMATA

Melnikov, B.F. 한국전산응용수학회 2000 The Korean journal of computational & applied math Vol.7 No.3

In this paper we consider the corrected version of the algorithm of the state-minimization for the nondeterministic finite automata: we correct here a mistake of the previous paper, where the same problem was considered.

ON AN EXPANSION OF NONDETERMINISTIC FINITE AUTOMATA

Melnikov, Boris 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.24 No.1

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.

SOME MORE ON THE FINITE AUTOMATA

Melnikov, B.F.,Vakhitova, A,A. 한국전산응용수학회 1998 Journal of applied mathematics & informatics Vol.5 No.3

Some new problems of the theory of the finite automata are considered. Applying the finite automata in various tasks of the formal languages theory is observed. Special proof of Kleene's theorem is obtained. This proof is used for the defining the star-height of the finite automaton. The proper-ties of the last object are considered. The star-height of the finite automaton is used for reformulating the star-height problem of regular expression for finite automata. The method of the reduction of the star-height problem to the task of making special finite automaton is obtained. This reformulating can help to solve the star-height problem by new way.

Implications of Global Energy Transition Trends on the Energy Sector and Development of Hydrogen Industry in Russia

Yury Melnikov,성진석,윤익중 한양대학교 아태지역연구센터 2022 중소연구 Vol.46 No.3

The purpose of this paper is to analyze the potential of low-carbon industry in Russia. At the same time, we also examined how unfolding global energy transition and rapidly changing energy market situations influence on prospects for low-carbon industry in the country. Russia has a long history of hydrogen industry and the potential to become one of the top hydrogen producers and exporter in the world. Hydrogen can also be useful for the newly developing low-carbon industry in Russia together with renewable sources of energy. The global energy transition has created opportunities and motivations for Russia to develop low-carbon energy systems, including hydrogen. It can use widely distributed natural resources in the country. Russia can produce low-carbon hydrogen base on renewable energy sources and also natural gas in combination with carbon capture and storage. However, in the aftermath of the Ukrainian crisis that broke out in February 2022, radically changing market environment in Europe and relations with European partners, Russia also faces challenges of overhauling its short-, mid- and long-term energy strategies, including hydrogen, renewable sources of energy, and climate policies . Now, Russia must focus more on the development of domestic market, redirecting trade flows away from its major European market and strengthen trades with so-called “friendly countries” and partnerships with them. The military conflicts in Ukraine have created additional insurmountable obstacles to efforts to achieve this goal. This paper concludes that the key barriers to the development of low-carbon industry in Russia are difficulties in finding markets for hydrogen exports, and the lack of incentives to apply low-carbon technologies. It is partly resulted by unambitious climate policy goals, high costs of renewable sources of energy and the lack of domestic technologies. In addition, the energy transition process and climate issues in Russia face serious challenges, even though the country has the large potential to develop low-carbon energy sectors. The current situation also suggests that it is necessary to overhaul energy strategies including green industry in the aftermath of deteriorating relations with key Western partners and the economic sanctions on Russia.

POSSIBLE EDGES OF A FINITE AUTOMATON DEFINING A GIVEN REGULAR LANGUAGE

Boris Melnikov,Natalia Sciarini-Guryanova 한국전산응용수학회 2002 Journal of applied mathematics & informatics Vol.9 No.2

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. 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.

On an expansion of nondeterministic finite automata

Boris Melnikov 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.24 No.1