On the synthesis of minimal sources
Diskretnaya Matematika, Tome 8 (1996) no. 4, pp. 37-43
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{DM_1996_8_4_a2,
author = {\v{S}. M. U\v{s}\'cumli\'c and A. S. Podkolzin},
title = {On the synthesis of minimal sources},
journal = {Diskretnaya Matematika},
pages = {37--43},
publisher = {mathdoc},
volume = {8},
number = {4},
year = {1996},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_1996_8_4_a2/}
}
Š. M. Ušćumlić; A. S. Podkolzin. On the synthesis of minimal sources. Diskretnaya Matematika, Tome 8 (1996) no. 4, pp. 37-43. http://geodesic.mathdoc.fr/item/DM_1996_8_4_a2/