Abstract:

In this talk, the non-autonomous Markov systems (NMS) defined in trees are introduced. We show that the commutativity of the entropy is valid for Markov systems defined in the null wondering tree. The null wondering trees are a broader class of trees, including the conventional d-trees, 3-1 trees and some of Markov trees. In addition, we investigate the non-isotropic NMSs, and show that the property of commutativity of entropy holds in such systems as well.