Author Details

Melnikov, Boris, Shenzhen MSU-BIT University, China, Russian Federation

  • 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 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 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 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)
  • Vol 12, No 6 (2024) - Theoretical Informatics and Computer Science
    On the software implementation of the groupoid of construction of PRI automaton and related computational experiments
    Abstract  PDF (Russian)
  • Vol 12, No 9 (2024) - Theoretical Informatics and Computer Science
    On an approach to the implementation of the Needleman – Wunsch and Jaro – Winkler algorithms and their application in the correlation analysis of the similarity of mitochondrial DNA of monkeys. Part I
    Abstract  PDF (Russian)
  • Vol 12, No 11 (2024) - Applied mathematics
    About one approach to calculating the rank correlation. Part I
    Abstract  PDF (Russian)
  • Vol 13, No 2 (2025) - Theoretical Informatics and Computer Science
    On an approach to the implementation of the Needleman – Wunsch and Jaro – Winkler algorithms and their application in the correlation analysis of the similarity of mitochondrial DNA of monkeys. Part II
    Abstract  PDF (Russian)