We consider several computational problems related to conjugacy between subshifts of finite type, restricted k -block codes: verifying a proposed conjugacy, deciding if two shifts admit and reducing the representation size shift via conjugacy. give polynomial-time algorithm for verification, show GI - NP -hardness size, respectively. Our approach focuses on 1-block conjugacies vertex shifts, fr...