摘要：In this paper we study the problem of equivalence between the languages of infix and postfix expressions over a universal algebra of type , having a finite domain of operators. Based on these results one can establish a result of characterization for the closure operator associated with a universal algebra in terms of formal languages
