Elsevier

Theoretical Computer Science

Volume 855, 6 February 2021, Pages 133-140
Theoretical Computer Science

Coded equivalence of one-sided topological Markov shifts

https://doi.org/10.1016/j.tcs.2020.11.044Get rights and content

Abstract

We introduce a notion of coded equivalence in one-sided topological Markov shifts. The notion is inspired by coding theory. One-sided topological conjugacy implies coded equivalence. We will show that coded equivalence implies continuous orbit equivalence of one-sided topological Markov shifts.

Section snippets

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Acknowledgements

The author would like to thank the referee for his/her careful reading the first draft of the paper. This work was supported by JSPS KAKENHI Grant Numbers 15K04896, 19K03537.

References (16)

  • F. Blanchard et al.

    Systems codés

    Theor. Comput. Sci.

    (1986)
  • M-P. Béal

    Codage Symbolique

    (1993)
  • J. Berstel et al.

    Theory of Codes

    (1985)
  • F. Blanchard et al.

    Sofic constant-to-one extensions of subshifts of finite type

    Proc. Am. Math. Soc.

    (1991)
  • M. Enomoto et al.

    K0-groups and classifications of Cuntz–Krieger algebras

    Math. Jpn.

    (1981)
  • D. Fiebig

    Common closing extensions and finitary regular isomorphisms for synchronized systems

  • D. Fiebig

    Common extensions and hyperbolic factor maps for coded systems

    Ergod. Theory Dyn. Syst.

    (1995)
  • D. Fiebig et al.

    Covers for coded system

There are more references available in the full text version of this article.
View full text