Undecidability of infinite post correspondence problem for instances of size 8
نویسندگان
چکیده
منابع مشابه
Undecidability of infinite post correspondence problem for instances of size 8
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by K. Ruohonen (1985) in general. Recently V. D. Blondel and V. Canterini (Theory Comput. Syst. 36, 231–245, 2003) showed that this problem is undecidable f...
متن کاملUndecidability of Infinite Post Correspondence Problem for Instances
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by Ruohonen (1985) in general. Recently Blondel and Canterini (Theory Comput. Syst. 36 (2003) 231–245) showed that this problem is undecidable for domain al...
متن کاملUndecidability of Infinite Post Correspon - dence Problem for Instances of Size 9 TUCS
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by K. Ruohonen (1985) in general. Recently V. D. Blondel and V. Canterini (Theory Comput. Syst. 36, 231–245, 2003) showed that this problem is undecidable f...
متن کاملThree Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language
It was noticed by Harel in [Har86] that “one can define Σ 1 -complete versions of the well-known Post Correspondence Problem”. We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a regular ω-language is Σ 1 -complete, hence located beyond the arithmetical hierarchy and highly undecidable. We infer from this result that it is Π 1 -complete to d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2012
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2012015