Автор(и):

Juliana Dochkova-Todorova, “St. Cyril and St. Methodius” University of Veliko Tarnovo, Bulgaria, doskova@ts.uni-vt.bg

Maya Hristova, “St. Cyril and St. Methodius” University of Veliko Tarnovo, Bulgaria, maia.hristova@ts.uni-vt.bg

https://doi.org/10.55630/STEM.2025.0705

Абстракт:

    The paper presents a study on the possibilities of applying STEM approaches in teaching language processors, with a focus on algorithms for recognizing input words. The authors examine different implementation options for recognizing regular languages and analyse the methodical aspects related to them. Typical mistakes made by students when creating the programs are systematized. Suggestions have been made on error detection methodologies, aimed at improving students' mastery of algorithmic thinking. The study also draws attention to the integration of artificial intelligence tools in solving programming tasks.

Ключови думи:

Finite Automata; Teaching Language Translators; Language Recognition; Regular Expressions;

Получена:

26-08-2025

Приета:

15-12-2025

Публикувана:

29-12-2025

Цитиране (APA style):

Dochkova-Todorova, J., Hristova, M. (2025). STEM Techniques in Programs for Recognizing Regular Languages in the Teaching of the “Language Processors” Course, Science Series "Innovative STEM Education", volume 07, ISSN: 2683-1333, Institute of Mathematics and Informatics – Bulgarian Academy of Sciences, pp. 41-60, DOI: https://doi.org/10.55630/STEM.2025.0705

Адрес на PDF файл:

http://www.math.bas.bg/vt/stemedu/books/07/STEM.2025.0705.pdf