This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (c) S is the set of binary strings in which each block of 0’s that immediately follows a block of 1’s is longer than that block of 1’s. 3. Let S be the set of binary strings (in which elements are uniquely created) given by S = { 11 } * ( { }{ 00 } * { 1 }{ 11 } * ∪ { 00 }{ 00 } * { 11 }{ 11 } * ) * { 00 } * . Find the generating function for S with respect to length, and describe in words the strings that belong to S . 4. For each of the following recursive deﬁnitions, describe in words the strings that belong to S , and explain why the strings of S are or are not uniquely created. (a) S = { ± } ∪ S { }{ } * { 1 }{ 1 } * (b) S = { ± } ∪ { , 1 } S { , 1 } ∪ SS ....
View
Full
Document
This note was uploaded on 08/13/2011 for the course MATH 239 taught by Professor M.pei during the Spring '09 term at Waterloo.
 Spring '09
 M.PEI
 Sets

Click to edit the document details