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)