Annotation

Annotation: The article considers aspects of translation of regular expressions from the source to the target dialect as a way to solve the problem of matching a string with an image. The purpose of this work is to develop and justify the architecture of a translator of regular expressions into different dialects taking into account the optimization of intermediate representations in the process of translation. The classification of dialects of regular expressions and the classification of software implementations of executors of finite automata described by regular expressions are presented. Recommendations are formulated for choosing a specific implementation of regular expressions in the aspect of text processing problems. An algorithm for optimizing regular expressions using population algorithms is described. The results of an experiment on optimizing intermediate representations of verification regular expressions using the differential evolution algorithm and the particle swarm algorithm are presented.