Question

Consider the language L=b(a*)a. List two L-distinguishable strings, and state a string z that distinguishes them.

Answer 1

Consider two strings be x and y such that x = aaa and y = baa. We can see that x and y are distinguisable string because for z = a, we can see that xz = aaaa does not belongs to L while yz = baaa belongs to L. Hence string x and y are distinguishable .

Please comment for any clarification.