I'm having troubles answering this question. Any help would be appreciated.Let's say we have the Post Correspondence Problem, so we have two  finite lists X and Y. But, there is no restriction about the indexes  we choose from X and Y, meaning the words we choose from list Y do not  have to correspond with the indexes from list X.In addition, the number of words we choose from list X do not have to  be the same as in list Y. (So for example, we can have 2 words in X  and 3 words in Y and we will still have a Correspondence).Is this problem decidable? If so, what complexity group does it belong  to (PTIME, EXPTIME, etc.)
Post Correspondence Prob - Find correspondence while the indexes and number of words can differ
algorithms;undecidability