0 votes
asked in TOC by (330 points)
Consider the following Two lists $L_1,\,L_2$ of strings over alphabet $\sum = \left \{ a,b \right \}$

$L_1=\left ( abb, aa, aaa \right ) L_2=\left ( bba,aaa,aa \right )$

The number of different Post Correspondence solutions for the above two lists is _________ .

1 Answer

0 votes
answered by
As i know,pcp is undecidable problem so no any algorithm exit to find the solution for this.we can solve only hit and trail for getting answer thus, after aplying this i got only one solution that is "213"
Welcome to Gatepoint Q&A, where you can ask questions and receive answers from other members of the community.
...