|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
R. M. Ashrapov, P. S. Dergach, “On covering sets of a special type by geometric progressions with a certain restrictions”, Chebyshevskii Sb., 25:5 (2024), 237–243  |
|
2023 |
| 2. |
P. S. Dergach, N. S. Botirova, “On changing the minimum glue length for alphabetic faults”, Intelligent systems. Theory and applications, 27:4 (2023), 79–88 |
| 3. |
P. S. Dergach, D. B. Bakhramova, “About automaton malfunctions in alphabetical coding”, Intelligent systems. Theory and applications, 27:4 (2023), 29–39 |
| 4. |
P. S. Dergach, S. R. Amirova, “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. |
P. S. Dergach, D. A. Saltsova, “On the complexity of converting to a correct linear form”, Intelligent systems. Theory and applications, 27:2 (2023), 68–76 |
|
2020 |
| 6. |
P. S. Dergach, L. R. Bulgakov, “About the dimension difference of periodic subsets of the natural series”, Intelligent systems. Theory and applications, 24:1 (2020), 129–141 |
|
2019 |
| 7. |
P. S. Dergach, D. E. Danilevskaya, “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 |
|
2018 |
| 8. |
P. S. Dergach, V. B. Kudryavtsev, “On the properties of languages that are stable to the drop/paste operations”, Intelligent systems. Theory and applications, 22:4 (2018), 153–167 |
| 9. |
R. A. Ishchenko, A. S. Podkolzin, D. N. Zhuk, S. V. Moiseev, A. M. Mironov, K. A. Golikov, P. S. Dergach, A. V. Galatenko, I. L. Mazurenko, A. Yu. Konovalov, E. A. Kurganov, “Reports from the Automata Theory seminar”, Intelligent systems. Theory and applications, 22:4 (2018), 137–142 |
| 10. |
P. S. Dergach, “On languages that are stable to the drop/paste operations”, Intelligent systems. Theory and applications, 22:2 (2018), 39–52 |
|
2017 |
| 11. |
P. S. Dergach, “About the maximum coverage of positive integers with some kind of restrictions”, Intelligent systems. Theory and applications, 21:4 (2017), 115–129 |
| 12. |
J. I. Radjabov, P. S. Dergach, “On the length of a minimal alphabetical bonding in linear regular languages”, Intelligent systems. Theory and applications, 21:3 (2017), 120–129 |
| 13. |
P. S. Dergach, “О решетке вложения прогрессивных множеств сложности два”, Intelligent systems. Theory and applications, 21:2 (2017), 117–162 |
| 14. |
P. S. Dergach, D. E. Danilevskaya, “О покрытиях и разбиениях натуральных чисел, имеющих два последовательных пропуска длины 1”, Intelligent systems. Theory and applications, 21:1 (2017), 192–237 |
|
2016 |
| 15. |
P. S. Dergach, “Об ограничениях на накрытие конечных семейств натуральных чисел”, Intelligent systems. Theory and applications, 20:3 (2016), 47–51 |
| 16. |
P. S. Dergach, “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. |
P. S. Dergach, A. Ayrapetov, “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 |
|
2015 |
| 18. |
P. S. Dergach, “About two spectral dimensions of the thin languages”, Intelligent systems. Theory and applications, 19:3 (2015), 155–174 |
| 19. |
A. Ayrapetov, P. S. Dergach, “About progressive decomposition of some subsets of the natural numbers”, Intelligent systems. Theory and applications, 19:3 (2015), 79–86 |
|
2014 |
| 20. |
P. S. Dergach, “On uniqueness of alphabetical decoding of ø-regular languages”, Diskr. Mat., 26:1 (2014), 32–48   ; Discrete Math. Appl., 24:3 (2014), 139–152  |
1
|
|
2012 |
| 21. |
P. S. Dergach, “On uniqueness of alphabetic decoding”, Diskr. Mat., 24:4 (2012), 70–80 ; Discrete Math. Appl., 22:5-6 (2012), 571–581 |
|
| Organisations |
|
|
