CLASSES OF TREE LANGUAGES DETERMINED BY CLASSES OF MONOIDS
Ferenc Gécseg · International Journal of Foundations of Computer Science · 2007
In this paper finite state recognizers are considered as unary tree recognizers with unary operational symbols. We introduce translation recognizers of a tree recognizer, which are finite state recognizers whose operations are the elementary translations of the underlying algebra of the considered tree recognizer. In terms of translation recognizers we give general conditions under which a class of recognizable tree languages with a given property can be determined by a class of monoids determining the class of string languages having the same property.