Author Details
Melnikov, Boris, Russian State Social University, Russian Federation
-
Vol 5, No 12 (2017) - Theoretical Informatics and Computer Science
Iterations of languages and finite automata
Abstract
PDF (Russian)
-
Vol 5, No 10 (2017) - Theoretical Informatics and Computer Science
The complete finite automaton
Abstract
PDF
-
Vol 5, No 12 (2017) - Theoretical Informatics and Computer Science
Waterloo-like finite automata and algorithms for their automatic construction
Abstract
PDF
-
Vol 6, No 1 (2018) - Theoretical Informatics and Computer Science
Pseudo-automata for generalized regular expressions
Abstract
PDF
-
Vol 6, No 2 (2018) - Mathematical modeling of processes and systems
Mathematical modeling of organization management by value guidelines: a method for setting optimization problems
Abstract
PDF (Russian)
-
Vol 6, No 3 (2018) - Mathematical modeling of processes and systems
Mathematical modeling of organization management by value guidelines: algorithms for complex estimation and selection of pseudo-optimal actions
Abstract
PDF (Russian)
-
Vol 6, No 5 (2018) - Mathematical modeling of processes and systems
Mathematical modeling of increasing the level of safety in case of failures of space technology
Abstract
PDF (Russian)
-
Vol 6, No 6 (2018) - Mathematical modeling of processes and systems
On a problem of the reconstruction of distance matrices between DNA sequences
Abstract
PDF (Russian)
-
Vol 6, No 7 (2018) - Theoretical Informatics and Computer Science
The star-height of a finite automaton and some related questions
Abstract
PDF
-
Vol 6, No 9 (2018) - Theoretical Informatics and Computer Science
On the extension of the finite automata class for context-free languages specification
Abstract
PDF
-
Vol 6, No 8 (2018) - Mathematical modeling of processes and systems
The application of the branch and bound method in the problem of reconstructing the matrix of distances between DNA strings
Abstract
PDF (Russian)
-
Vol 6, No 9 (2018) - Theoretical Informatics and Computer Science
An approach to the classification of the loops of finite automata. Part I: Long corresponding loops
Abstract
PDF
-
Vol 6, No 11 (2018) - Theoretical Informatics and Computer Science
An approach to the classification of the loops of finite automata. Part II: The classification of the states based on the loops
Abstract
PDF
-
Vol 7, No 3 (2019) - Theoretical Informatics and Computer Science
On the task of extracting the root from the language
Abstract
PDF
-
Vol 7, No 4 (2019) - Theoretical Informatics and Computer Science
Some more on the equivalent transformation of nondeterministic finite automata. Part I. Notation and the "combining" algorithm
Abstract
PDF
-
Vol 7, No 9 (2019) - Theoretical Informatics and Computer Science
Some more on the equivalent transformation of nondeterministic finite automata. Part II. The "deleting" algorithm
Abstract
PDF
-
Vol 7, No 12 (2019) - Theoretical Informatics and Computer Science
Some more on the equivalent transformation of nondeterministic finite automata. Part III. The “adding” algorithm
Abstract
PDF
-
Vol 8, No 8 (2020) - Theoretical Informatics and Computer Science
Some more on omega-finite automata and omega-regular languages. Part I: The main definitions and properties
Abstract
PDF
-
Vol 9, No 1 (2021) - Applied mathematics
Building communication networks: on the application of the Kruskal’s algorithm in the problems of large dimensions
Abstract
PDF (Russian)
-
Vol 9, No 11 (2021) - Theoretical Informatics and Computer Science
A polynomial algorithm for constructing a finite automaton for determining the equality of infinite iterations of two finite languages
Abstract
PDF (Russian)
-
Vol 10, No 6 (2022) - Mathematical modeling of processes and systems
About one problem of analysis of the topology of communication networks
Abstract
PDF (Russian)
-
Vol 10, No 5 (2022) - Theoretical Informatics and Computer Science
Semi-lattices of the subsets of potential roots in the problems of the formal languages theory. Part II. Construction of an inverse morphism
Abstract
PDF (Russian)
-
Vol 10, No 7 (2022) - Theoretical Informatics and Computer Science
Semi-lattices of the subsets of potential roots in the problems of the formal languages theory. Part III. The condition for the existence of a lattice
Abstract
PDF (Russian)
-
Vol 10, No 9 (2022) - Theoretical Informatics and Computer Science
Petal (semi-flower) finite automata: basic definitions, examples and their relation to complete automata. Part I
Abstract
PDF (Russian)
-
Vol 10, No 9 (2022) - Theoretical Informatics and Computer Science
Simplified regular languages and a special equivalence relation on the class of regular languages. Part I
Abstract
PDF (Russian)
-
Vol 10, No 10 (2022) - Theoretical Informatics and Computer Science
Petal (semi-flower) finite automata: basic definitions, examples and their relation to complete automata. Part II
Abstract
PDF (Russian)
-
Vol 10, No 12 (2022) - Theoretical Informatics and Computer Science
A polynomial algorithm for checking the fulfillment of the condition of the morphic image of the extended maximal prefix code
Abstract
PDF (Russian)
-
Vol 11, No 1 (2023) - Theoretical Informatics and Computer Science
On the complex of problems for the study of the necessary conditions for the equality of infinite iterations of finite languages
Abstract
PDF (Russian)
-
Vol 11, No 1 (2023) - Theoretical Informatics and Computer Science
Simplified regular languages and a special equivalence relation on the class of regular languages. Part II
Abstract
PDF (Russian)
-
Vol 11, No 3 (2023) - Theoretical Informatics and Computer Science
The use of petal finite automata to verify the fulfillment of a special case of the Zyu hypothesis (for a given finite language)
Abstract
PDF (Russian)
-
Vol 11, No 5 (2023) - Theoretical Informatics and Computer Science
On the problems of extracting the root from a given finite language
Abstract
PDF (Russian)
-
Vol 11, No 6 (2023) - Theoretical Informatics and Computer Science
A polynomial algorithm for constructing the optimal inverse morphism
Abstract
PDF (Russian)
-
Vol 11, No 9 (2023) - Theoretical Informatics and Computer Science
On the groupoid of the primary automaton PRI defined for the only finite language
Abstract
PDF (Russian)
-
Vol 11, No 11 (2023) - Theoretical Informatics and Computer Science
Eight variants of finite automata for checking the fulfillment of the coverage relation of iterations of two finite languages. Part I
Abstract
PDF (Russian)
-
Vol 12, No 1 (2024) - Theoretical Informatics and Computer Science
On the connection of special binary relations with conditions of commuting languages. Part II. The main statements
Abstract
PDF (Russian)
-
Vol 12, No 2 (2024) - Theoretical Informatics and Computer Science
Eight variants of finite automata for checking the fulfillment of the coverage relation of iterations of two finite languages. Part II
Abstract
PDF (Russian)
-
Vol 12, No 3 (2024) - Applied mathematics
On the application a number of predictors in the branch and bound method (on the example of the random variant of the traveling salesman problem)
Abstract
PDF (Russian)