|
|
|
|
|
Tatiana Generalova
Pág. 1 - 4
A new formalism for the specification of context-free languages is presented. In this formalism, a generalization of the class of nondeterministic finite automata can be obtained by using an auxiliary alphabet and imposing addit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tatiana Generalova
Pág. 1 - 4
A new formalism for the specification of context-free languages is presented. In this formalism, a generalization of the class of nondeterministic finite automata can be obtained by using an auxiliary alphabet and imposing addit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 7
In the second part of this paper, we continue to consider a special extension of the class of nondeterministic finite automata. We show by examples the following fact: there are regular languages, in the basis automata of which, some vertices do not have...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ferdinand Settele, Alexander Weber and Alexander Knoll
In this note, the application of a plant model-based fault detection method for nonlinear control systems on aircraft takeoff is introduced. This method utilizes non-deterministic finite-state automata, which approximate the fault-free dynamics of the pl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nan Zhang, Baizhen Li, Zhongxi Zhang and Yanyan Guo
The binary discernibility matrix, originally introduced by Felix and Ushio, is a binary matrix representation for storing discernible attributes that can distinguish different objects in decision systems. It is an effective approach for feature selection...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nan Zhang, Baizhen Li, Zhongxi Zhang and Yanyan Guo
-
|
|
|
|
|
|
|
|
|
|
|
Tatiana Generalova,Boris Melnikov,Alexey Vylitok
Pág. 1 - 8
In this paper, a new formalism for specification of context-free languages is proposed. In this formalism, the application of an auxiliary alphabet and the imposition of additional conditions make it possible to obtain an extension of the class of n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 8
In this paper, we introduce a new formalism which is intended for representing a special extensions of finite automata. We call them generalized nondeterministic finite pseudo-automata. This formalism gives not only the equivalence be...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Elena Melnikova
Pág. 8 - 15
In the problems of minimization of nondeterministic finite automata, there may be situations, when a covering set of blocks defines an automaton, which is not equivalent to the original one. For the first time, such an example was obtained...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Alexey Vylitok,Elena Melnikova
Pág. 1 - 7
In this paper we consider the representation of iterations of finite languages using special nondeterministic finite automata. For two iterated languages, a special equivalence relation is defined. We give the reduction of the conditions for the fulfillm...
ver más
|
|
|
|
|
|
|
|
|
|
|
O. S. Raspopov
Pág. 125 - 133
The possibilities of applying logical machine, the method of initial parameters and associated matrixes into spatial vibration analysis of rod and beam constructions with continues parameters have been researched.
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 8
In this paper, we consider a special extension of the class of non-deterministic finite automata. The purpose of this consideration is the following: first, to describe using such automata various brute-force algorithms of equivalent transformation of au...
ver más
|
|
|
|
|
|
|
|
|
|
|
Faissal Ouardi, Zineb Lotfi and Bilal Elghadyry
This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression. Allauzen and Mohri have presented a unified construction of small automata and gave a cons...
ver más
|
|
|
|
|
|
|
|
|
|
|
Angelina Puput Giovani,Faried Zamachsari,Efid Dwi Agustono,Muhammad Ilham Prasetya,Windu Gata
Pág. 221 - 228
Menyelesaikan Pendidikan Magister Ilmu Komputer pada STMIK Nusa Mandiri dalam waktu 4 semester merupakan harapan setiap mahasiswa. Untuk dapat lulus tepat waktu setiap mahasiswa wajib memenuhi semua persyaratan yang telah ditentukan oleh pihak kampus. Da...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Vasily Dolgov
Pág. 13 - 19
The equivalence relation S on the class of regular languages, considered in this paper, is necessary for a more complete study of the relation R previously defined in our articles. In addition, the motivation for considering the relation S is the need to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Vasily Dolgov
Pág. 12 - 20
The equivalence relation S on the class of regular languages, considered in this paper, is necessary for a more complete study of the relation R previously defined in our articles. In addition, the motivation for considering the relation S is the need to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 8
Quite briefly, the subject of this paper can be formulated as follows: in the previously considered infinite iterative morphism trees, we combine equivalent vertices, in fact, obtaining a deterministic finite automaton; after that, we investigate some pr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 8
Quite briefly, the subject of this paper can be formulated as follows: in the previously considered infinite iterative morphism trees, we combine equivalent vertices, in fact, obtaining a deterministic finite automaton; after that, we investigate some pr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 7
The finite and infinite iterations of finite and infinite languages arise in various problems of the formal languages theory.For instance, we can mention their application for the description of subclasses of the context-free languages class with the dec...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 11
This paper discusses (non-deterministic) finite automata of a special kind. We have not found any publications in the literature in Russian that define the title for such automata, so we propose a new name for them, i.e. ?petal automata?. (In the only pu...
ver más
|
|
|
|
|
|