Computational Complexity of k-Block Conjugacy

09/05/2019
by   Tyler Schrock, et al.
0

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

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/07/2021

Computational complexity of problems for deterministic presentations of sofic shifts

Sofic shifts are symbolic dynamical systems defined by the set of bi-inf...
05/10/2018

Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts

We propose necessary conditions of soficness of multidimensional shifts ...
01/02/2019

Deciding the existence of minority terms

This paper investigates the computational complexity of deciding if a gi...
02/05/2018

The expressiveness of quasiperiodic and minimal shifts of finite type

We study multidimensional minima and quasiperiodic shifts of finite type...
04/29/2021

Parameterized String Equations

We study systems of String Equations where block variables need to be as...
06/28/2021

Modeling the Block Verification Time of Zcash

An important aspect of the propagation delay in blockchain networks is t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.