On Bi-infinite and Conjugate Post Correspondence Problems - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) Année : 2023

On Bi-infinite and Conjugate Post Correspondence Problems

Résumé

We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where we require the images of a solution for two given morphisms are conjugates of each other. For the bi-infinite PCP we show that it is in the class Σ^0 _2 of the arithmetical hierarchy and for the conjugate PCP we give an undecidability proof by reducing it to the word problem for a special type of semi-Thue systems.
Fichier principal
Vignette du fichier
FinHalHarSah_22.pdf (515.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03780128 , version 1 (19-09-2022)

Identifiants

  • HAL Id : hal-03780128 , version 1

Citer

Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla. On Bi-infinite and Conjugate Post Correspondence Problems. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2023, 57, Article number 7, p. 1-11. ⟨hal-03780128⟩
53 Consultations
46 Téléchargements

Partager

Gmail Facebook X LinkedIn More