## The Twin Conjugacy Search Problem and Applications

- Xiaoming Chen, Weiqing You
- IACR Cryptology ePrint Archive
- 2018

@inproceedings{Kaya2016TheCO, title={The Complexity of the Topological Conjugacy Problem for Toeplitz Subshifts}, author={Burak Kaya}, year={2016} }

- Published 2016

In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show that the topological conjugacy relation is hyperfinite on a larger class of Toeplitz subshifts which we call Toeplitz subshifts with growing blocks. This result provides a partial answer to a question asked by Sabok and Tsankov.