Binary Strings Question

892 Views Asked by At

prove that the following expression for a set of binary strings S is ambigious S = {101,1101,1011}* Thanks for all your help!

1

There are 1 best solutions below

0
On

I don't see anything ambiguous about the expression. It's not standard mathematical notation, but as far as it's meant to denote the set of all strings that can be formed by concatenating any finite number of occurrences of 101, 1101 and 1011, it seems clear enough. My guess is that you mean you want to show that there are strings that can be formed in more than one way from these substrings. An example of such a string is afforded by 1011101, which is both 1011 101 and 101 1101.