SYNTHESIS OF NONDETERMINISTIC FINITE AUTOMATON FROM REGULAR EXPRESSIONS BY GLUSHKOV'S ALGORITHM IN JFF FORMAT
Dmitriy Lobaryov, N. LOBARYOV · HERALD OF POLOTSK STATE UNIVERSITY Series С FUNDAMENTAL SCIENCES · 2025
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.