Dergach Petr Sergeevich

Publications in Math-Net.Ru

1. On covering sets of a special type by geometric progressions with a certain restrictions
   
   Chebyshevskii Sb., 25:5 (2024),  237–243
2. On changing the minimum glue length for alphabetic faults
   
   Intelligent systems. Theory and applications, 27:4 (2023),  79–88
3. About automaton malfunctions in alphabetical coding
   
   Intelligent systems. Theory and applications, 27:4 (2023),  29–39
4. On the complexity of converting pairs of words with respect to drop-in operations of a special type
   
   Intelligent systems. Theory and applications, 27:3 (2023),  122–136
5. On the complexity of converting to a correct linear form
   
   Intelligent systems. Theory and applications, 27:2 (2023),  68–76
6. About the dimension difference of periodic subsets of the natural series
   
   Intelligent systems. Theory and applications, 24:1 (2020),  129–141
7. On the progressive representation of periodic sets with restrictions on the beginning and the step
   
   Intelligent systems. Theory and applications, 23:1 (2019),  89–97
8. On the properties of languages that are stable to the drop/paste operations
   
   Intelligent systems. Theory and applications, 22:4 (2018),  153–167
9. Reports from the Automata Theory seminar
   
   Intelligent systems. Theory and applications, 22:4 (2018),  137–142
10. On languages that are stable to the drop/paste operations
    
    Intelligent systems. Theory and applications, 22:2 (2018),  39–52
11. About the maximum coverage of positive integers with some kind of restrictions
    
    Intelligent systems. Theory and applications, 21:4 (2017),  115–129
12. On the length of a minimal alphabetical bonding in linear regular languages
    
    Intelligent systems. Theory and applications, 21:3 (2017),  120–129
13. О решетке вложения прогрессивных множеств сложности два
    
    Intelligent systems. Theory and applications, 21:2 (2017),  117–162
14. О покрытиях и разбиениях натуральных чисел, имеющих два последовательных пропуска длины 1
    
    Intelligent systems. Theory and applications, 21:1 (2017),  192–237
15. Об ограничениях на накрытие конечных семейств натуральных чисел
    
    Intelligent systems. Theory and applications, 20:3 (2016),  47–51
16. About the checking the uniqueness of the alphabetical decoding problem in the class of regular languages with polynomial growth function
    
    Intelligent systems. Theory and applications, 20:2 (2016),  147–202
17. About the progressive decomposition of the series of natural numbers with the 2-length hole
    
    Intelligent systems. Theory and applications, 20:2 (2016),  67–86
18. About two spectral dimensions of the thin languages
    
    Intelligent systems. Theory and applications, 19:3 (2015),  155–174
19. About progressive decomposition of some subsets of the natural numbers
    
    Intelligent systems. Theory and applications, 19:3 (2015),  79–86
20. On uniqueness of alphabetical decoding of ø-regular languages
    
    Diskr. Mat., 26:1 (2014),  32–48
21. On uniqueness of alphabetic decoding
    
    Diskr. Mat., 24:4 (2012),  70–80