Undecidability of infinite post correspondence problem for instances of size 8-Reference-Cited by-同舟云学术

Undecidability of infinite post correspondence problem for instances of size 8

Published:2012-06-22 Issue:3 Volume:46 Page:451-457
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Dong Jing,Liu Qinghui

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/2012015/pdf

Reference7 articles.

1. Blondel V.D. and Canterini V., Undecidable problems for probabilistic automata of fixed dimension.Theor. Comput. Syst.36(2003) 231–245.

2. Ehrenfeucht A., Karhumäki J. and Rozenberg G., The (generalized) Post Correspondence Problem with lists consisting of two words is decidable.Theoret. Comput. Sci.21(1982) 119–144.

3. Halava V. and Harju T., Undecibability of infinite Post Correspondence Problem for instances of size 9.RAIRO–Theor. Inf. Appl.40(2006) 551–557.

4. Halava V., Harju T. and Hirvensalo M., Binary (generalized) Post Correspondence Problem.Theoret. Comput. Sci.276(2002) 183–204.

5. Matiyasevich Y. and Sénizergues G., Decision problems for semi-Thue systems with a few rules.Theoret. Comput. Sci.330(2005) 145–169.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On bi-infinite and conjugate post correspondence problems;RAIRO - Theoretical Informatics and Applications;2023

2. Integer Weighted Automata on Infinite Words;International Journal of Foundations of Computer Science;2022-10-31

3. Integer Weighted Automata on Infinite Words;Developments in Language Theory;2021

4. Porous Invariants;Computer Aided Verification;2021

5. A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem;Fundamenta Informaticae;2017-08-09