0 votes
asked in TOC by (580 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 _________ .

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.
Welcome to Gatepoint Q&A, where you can ask questions and receive answers from other members of the community.