Abstract: | A finite-automaton-algebraic model of formal languages is described. It is shown how particular cases of this model characterize the classes of recursively enumerable and context-free languages.Translated from Kibernetika, No. 4, pp. 16–20, July–August, 1990. |