Abstract
In this paper, we show that the commutativity of the entropy for nonautonomous Markov systems holds on an aperiodic recursive tree. Then the similar result is extended to p-periodic and anisotropic systems. Finally, we give a characterization for a Markov tree to be a complete recursive tree in terms of the properties of the associated adjacency matrix.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Paper Title
Journal
Date
