Melnikova, Aleksandra, Russian Federation
-
Vol 7, No 10 (2019) - Theoretical Informatics and Computer Science
Extended basis finite automaton. Part I. The basic definitions
Abstract PDF (Russian) -
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 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 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 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)