Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-24T10:41:15.424Z Has data issue: false hasContentIssue false
  • English
  • Français

On the flips for a synchronized system

Published online by Cambridge University Press:  28 June 2013

HYEKYOUNG CHOI  and
YOUNG-ONE KIM
HYEKYOUNG CHOI
Affiliation:
Department of Mathematical Sciences and Research Institute of Mathematics, Seoul National University, Seoul 151-747, Korea email [email protected]@math.snu.ac.kr
YOUNG-ONE KIM
Affiliation:
Department of Mathematical Sciences and Research Institute of Mathematics, Seoul National University, Seoul 151-747, Korea email [email protected]@math.snu.ac.kr
Get access Rights & Permissions [Opens in a new window]

Abstract

It is shown that if an infinite synchronized system has a flip, then it has infinitely many non-conjugate flips, and that the result cannot be extended to the class of coded systems.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 34 , Issue 6 , December 2014 , pp. 1807 - 1815
Copyright
© Cambridge University Press, 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Blanchard, F. and Hansel, G.. Systèmes codés. Theoret. Comput. Sci. 44 (1986), 17–49.Google Scholar
Coven, E. M.. Endomorphisms of substitution minimal sets. Z. Wahrsch. Verw. Gebiete 20 (1971), 129–133.Google Scholar
Fiebig, D. and Fiebig, U.-R.. The automorphism group of a coded system. Trans. Amer. Math. Soc. 348 (1996), 3173–3191.CrossRefGoogle Scholar
Gottschalk, W. H. and Hedlund, G. A.. A characterization of the Morse minimal set. Proc. Amer. Math. Soc. 15 (1964), 70–74.CrossRefGoogle Scholar
Kim, Y.-O., Lee, J. and Park, K. K.. A zeta function for flip systems. Pacific J. Math. 209 (2003), 289–301.Google Scholar
Krieger, W.. On sofic systems I. Israel J. Math. 48 (1984), 305–330.Google Scholar
Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.Google Scholar
Morse, M. and Hedlund, G. A.. Unending chess, symbolic dynamics and a problem in semigroups. Duke Math. J. 11 (1944), 1–7.CrossRefGoogle Scholar