The Conjugate Post Correspondence Problem

11/08/2021
by   Vesa Halava, et al.
0

We introduce a modification to the Post Correspondence Problem where (in the formulation using morphisms) we require the images to be conjugate words. This problem is then shown to be undecidable by reducing it to the word problem for a special type of semi-Thue systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2021

The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups

We define the symmetric Post Correspondence Problem (PCP) and prove that...
research
04/12/2021

Variations on the Post Correspondence Problem for free groups

The Post Correspondence Problem is a classical decision problem about eq...
research
04/30/2022

Baba is You is Undecidable

We establish the undecidability of 2019 puzzle game Baba is You through ...
research
11/22/2022

Post's correspondence problem for hyperbolic and virtually nilpotent groups

Post's Correspondence Problem (the PCP) is a classical decision problem ...
research
07/28/2022

Extraction of Coronary Vessels in Fluoroscopic X-Ray Sequences Using Vessel Correspondence Optimization

We present a method to extract coronary vessels from fluoroscopic x-ray ...
research
12/23/2019

Formalizing the Curry-Howard Correspondence

The Curry-Howard Correspondence has a long history, and still is a topic...
research
05/17/2016

Word2Vec is a special case of Kernel Correspondence Analysis and Kernels for Natural Language Processing

We show Correspondence Analysis (CA) is equivalent to defining Gini-inde...

Please sign up or login with your details

Forgot password? Click here to reset