Ergodic optimization for countable alphabet subshifts of finite type

From MaRDI portal
Revision as of 05:03, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5757200

DOI10.1017/S014338570600040XzbMath1123.37002MaRDI QIDQ5757200

R. Daniel Mauldin, Mariusz Urbański, Oliver Jenkinson

Publication date: 6 September 2007

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)




Related Items (14)







This page was built for publication: Ergodic optimization for countable alphabet subshifts of finite type