Time remaining:
Let us define a set S of binary strings according to the following rules:

Mathematics
Tutor: None Selected Time limit: 0 Hours

  1. Let us define a set S of binary strings according to the following rules:

    Base: The empty string and the string 1 are in S.

    Recursion: If xεS, then so are x0 and x11.  (That is, x followed by 0 or 11.)

    If S contains no other strings, which of the following strings are in S?

Apr 18th, 2015

First, any (non-empty) string from S begins from 1. So, the two last strings (#6 and #7) not in S.

Second, after the first 1 must go 0 or 11, so string #3 "11" and #4 "1101" not in S.

Next, string #1 "111" in S, "111" = "1" + "11".
String #5, "1011" in S, "1" + "0" + "11".

And the remaining string is #2, "10101".
It isn't in S. There is "1", then "0", and then "101", but "101" doesn't begin from "0" or from "11".

Apr 18th, 2015

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
Apr 18th, 2015
...
Apr 18th, 2015
Mar 27th, 2017
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer