On the synthesis of minimal sources

We consider the problem of synthesis of a source representing a given regular expression. It is known that the algorithms based on the methods suggested by Glushkov give sources which are not always minimal with respect to the number of vertices. In this paper we suggest the general approach to the construction of algorithms which synthesize the minimal sources representing regular expressions of various classes.