Author Details
Melnikov, Boris, Russian Federation
-
Vol 5, No 12 (2017) - Theoretical Informatics and Computer Science
Iterations of languages and finite automata
Abstract
PDF (Russian)
-
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 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 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 8 (2019) - Mathematical modeling of processes and systems
Mathematical modeling of organization management by value guidelines: algorithms for analytic hierarchy process on the basis of quantitative significance criteria
Abstract
PDF (Russian)
-
Vol 7, No 10 (2019) - Theoretical Informatics and Computer Science
Extended basis finite automaton. Part I. The basic definitions
Abstract
PDF (Russian)
-
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 5 (2020) - Theoretical Informatics and Computer Science
Extended basis finite automaton. Part II. Description of auxiliary languages and some properties
Abstract
PDF (Russian)
-
Vol 8, No 9 (2020) - Theoretical Informatics and Computer Science
On the application of some heuristics in the study of the state minimization problem for nondeterministic finite automata by the branch and bound method. Part 1
Abstract
PDF (Russian)
-
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 3 (2021) - Theoretical Informatics and Computer Science
On a subclass of the regular language class (“strongly connected” languages): definitions and corresponding canonical automata
Abstract
PDF (Russian)
-
Vol 9, No 4 (2021) - Theoretical Informatics and Computer Science
Infinite trees in the algorithm for checking the equivalence condition of iterations of finite languages. Part I
Abstract
PDF (Russian)
-
Vol 9, No 5 (2021) - Theoretical Informatics and Computer Science
Infinite trees in the algorithm for checking the equivalence condition of iterations of finite languages. Part II
Abstract
PDF (Russian)
-
Vol 9, No 6 (2021) - Theoretical Informatics and Computer Science
Automata – complete invariants for strongly connected regular languages
Abstract
PDF (Russian)
-
Vol 9, No 7 (2021) - Theoretical Informatics and Computer Science
Variants of finite automata corresponding to infinite iterative morphism trees. Part I
Abstract
PDF (Russian)
-
Vol 9, No 10 (2021) - Theoretical Informatics and Computer Science
Variants of finite automata corresponding to infinite iterative morphism trees. Part II
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 4 (2022) - Theoretical Informatics and Computer Science
Semi-lattices of the subsets of potential roots in the problems of the formal languages theory. Part I. Extracting the root from the language
Abstract
PDF (Russian)
-
Vol 11, No 7 (2023) - Theoretical Informatics and Computer Science
On the connection of special binary relations with conditions of commuting languages. Part I. Divisors in the global supermonoid
Abstract
PDF (Russian)