  It is well known that attributed tree transducers can be equipped with
"regular look-around" in order to obtain a more robust class of translations.
We present two characterizations of this class in terms of macro tree
transducers (MTTs): the first one is a static restriction on the rules of the
MTTs, where the MTTs need to be equipped with regular look-around. The second
characterization is a dynamic one, where the MTTs only need regular look-ahead.
