Undecidability of infinite post correspondence problem for instances of Size 9.

Vesa Halava Tero Harju

Published in: RAIRO Theor. Informatics Appl. (2006)

Keyphrases

description logics
small size
case study
genetic algorithm
computational complexity
randomly generated
lower and upper bounds
partially observable
correspondence matching