SYNTHESIS OF NONDETERMINISTIC FINITE AUTOMATON FROM REGULAR EXPRESSIONS BY GLUSHKOV'S ALGORITHM IN JFF FORMAT

Main Article Content

D. LOBARYOV
N. LOBARYOV

Abstract

The paper presents the results of the implementation of a software tool for synthesizing nondeterministic finite automaton using regular expressions in JFF format. Glushkov's algorithm is used as a method for synthesizing automata. When developing the program, the integrated development environment for the Python – Visual Studio Code, the JFLAP software package for visualizing finite automaton, as well as the Python libraries xml.etree and pythonds were used.

Article Details

How to Cite
LOBARYOV, D., & LOBARYOV, N. (2025). SYNTHESIS OF NONDETERMINISTIC FINITE AUTOMATON FROM REGULAR EXPRESSIONS BY GLUSHKOV’S ALGORITHM IN JFF FORMAT. Vestnik of Polotsk State University. Part C. Fundamental Sciences, (1), 9-13. https://doi.org/10.52928/2070-1624-2025-44-1-9-13

References

Khopkroft, D. E., Motvani, R., & Ul'man, D. (2008). Vvedenie v teoriyu avtomatov, yazykov i vychislenii. Moscow: Vil'yams. (In Russ.).

Kogabaev, N. T., (2023). Diskretnaya matematika i teoriya algoritmov. Novosibirsk: IPTs NGU. (In Russ.).

Glushkov, V. M. The abstract theory of automata. (1961). Russian Mathematical Surveys, 16(5), 1–53. DOI: 10.1070/RM1961v016n05ABEH004112.

Lobarev, D. S., & Tolbukhin, D. V. (2021). Poisk optimal'nogo resheniya differentsial'noi lineino-kvadratichnoi zadachi upravleniya sredstvami Python v oblachnoi srede Google Colab [Search for the optimal solution to the differential linearquadratic Python management problem in the Google Colab cloud environment]. Nauchno-tekhnicheskii vestnik Povolzh'ya. (12), 208–213. (In Russ., abstr. in Engl.).