On the complexity of the realization of finite languages by formulas

We consider realizations of finite languages of regular expressions over finite alphabets by formulas with minimal complexity. Some classes of languages are investigated and for their complexities the best bounds up to the order are obtained. The main attention is given to realizations of languages consisting of words of equal length.