Training simulator for algorithm theory

Context and relevance. In the work programs of the disciplines «Theory of Algorithms», «Compilation Methods», «Discrete Mathematics» and others included in the educational programs of specialties in information technology, the concepts of algorithm, finite automata and formal languages occupy an important place. Mastering these concepts requires abstract thinking abilities from students and often cause significant difficulties. Purpose. Improve the quality of assimilation of educational material in disciplines related to the concept of an algorithm using special software tools for visualization and modeling of various finite state machines. Hypothesis. The use of training simulators to demonstrate algorithm models allows the teacher to present the material as clearly as possible, and it is better for students to master the material and gain skills in solving problems in algorithm theory. Methods and materials. The study examined existing software tools for constructing graphs, diagrams of automata, Turing machines. The analysis revealed the shortcomings of individual tools, namely: limited capabilities, inconvenient interface, the need to comply with licensing. Results. A web application «FSM-Desiner» has been developed, which plays the role of a training simulator in algorithm theory. The application has a simple interface, the ability to build and simulate finite state machines, store memory machines and Turing machines. The experience of using the simulator showed that students began to cope with tasks better. In addition, it turned out that students had difficulty using artificial intelligence when solving problems, and this was easily detected. Conclusions. The use of the training simulator confirmed the importance of using special software tools for mastering the material on the theory of algorithms.

1. хо, А., Ульман, Дж. (1978). Теория синтаксического анализа, перевода и компиляции. М.: Мир.
   Aho, A., & Ullman, J. (1978). The Theory of Parsing, Translation, and Compiling. Moscow: Mir. (In Russ.).
2. Лукин, В. Н., Чернышов, Л. Н. (2021). Вычислительные процессы: теория трансляции, управление данными и сети Петри. М.: Вузовская книга.
   Lukin, V. N., & Chernyshov, L. N. (2021). Computational Processes: Translation Theory, Data Management, and Petri Nets. Moscow: Vuzovskaia kniga. (In Russ.).
3. Поляков, В. И., Скорубский, В. И. (2012). Основы теории алгоритмов. СПб.: СПб НИУ ИТМО.
   Polyakov, V. I., & Skorubsky, V. I. (2012). Fundamentals of Algorithm Theory. Petersburg: ITMO University. (In Russ.).
4. Хопкрофт, Дж. Э., Мотвани, Р., Ульман, Дж. (2002). Введение в теорию автоматов, языков и вычислений (2-е изд.). М.: Издательский дом «Вильямс».
   Hopcroft, J. E., Motwani, R., & Ullman, J. (2002). Introduction to Automata Theory, Languages, and Computation (2nd ed.). Moscow: Williams Publishing House. (In Russ.).
5. Чернецкая, И. Е. (2022). Применение конечных автоматов для поиска и распознавания подстрок: методические рекомендации к лабораторной работе. Курск: Юго-Зап. гос. ун-т. URL: https://swsu.ru/sveden/files/MU_LZNo_2_Teoriya_avtomatov.pdf (дата обращения: 10.08.2025).
   Chernetskaya, I. E. (2022). Application of Finite Automata for Searching and Recognizing Substrings: Methodological Guidelines for a Laboratory Work. Kursk: Southwest State University. URL: https://swsu.ru/sveden/files/MU_LZNo_2_Teoriya_avtomatov.pdf (viewed: 10.08.2025). (In Russ.).
6. Инструмент для построения диаграммы состояния (2025). URL: https://creately.com (дата обращения: 10.08.2025).
   State diagramming tool (2025). URL: https://creately.com (viewed: 10.08.2025).
7. Редактор графов. URL: https://programforyou.ru/graph-redactor (дата обращения: 10.08.2025).
   Graph editor. URL: https://programforyou.ru/graph-redactor (viewed: 10.08.2025). (In Russ.).
8. Самая сложная задача математики? Математики ищут число, которое определит предел познания. URL: https://www.ixbt.com/live/science/samaya-slozhnaya-zadacha-matematiki-matematiki-ischut-chislo-kotoroe-opredelit-predel-poznaniya.html (дата обращения: 10.08.2025).
   The hardest problem in mathematics? Mathematicians are searching for a number that will determine the limits of knowledge. URL: https://www.ixbt.com/live/science/samaya-slozhnaya-zadacha-matematiki-matematiki-ischut-chislo-kotoroe-opredelit-predel-poznaniya.html (viewed: 10.08.2025). (In Russ.).
9. Эмулятор машины Тьюринга. URL: https://programforyou.ru/calculators/turing-machine-emulator (дата обращения: 10.08.2025).
   Turing machine emulator. URL: https://programforyou.ru/calculators/turing-machine-emulator (viewed: 10.08.2025). (In Russ.).
10. URL: https://automatatutor.com (viewed: 10.08.2025).
11. Busy Beaver. URL: https://ru.wikipedia.org/wiki/Busy_beaver (дата обращения: 10.08.2025).
    Busy Beaver. URL: https://ru.wikipedia.org/wiki/Busy_beaver (viewed: 10.08.2025). (In Russ.).
12. JFLAP Version 7.1 released July 27 (2018). URL: https://www.jflap.org (viewed: 10.08.2025).
13. Finite Automata Designer. URL: https://fa.akdev.ir (viewed: 10.08.2025).
14. Lean — инструмент интерактивного доказательства теорем (2025). URL: https://ru.wikipedia.org/wiki/Lean (дата обращения: 10.08.2025).
    Lean — an interactive theorem prover (2025). URL: https://ru.wikipedia.org/wiki/Lean (viewed: 10.08.2025). (In Russ.).
15. The Busy Beaver Challenge (2025). URL: https://wiki.bbchallenge.org (viewed: 10.08.2025).
16. Turing Machine Visualization. URL: https://turingmachine.io (viewed: 10.08.2025).
17. Finite State Machine Designer. URL: https://madebyevan.com (viewed: 10.08.2025).