91Ó°ÊÓ

Using the sets \(A=\\{a, b, e, h\\}, B=\\{b, c, e, f, h\\}, C=\\{c, d, f, g\\},\) and \(U=\\{a, \ldots, h\\},\) find the binary representation of each set. \(A \cup B\)

Using the sets \(A=\\{a, b, e, h\\}, B=\\{b, c, e, f, h\\}, C=\\{c, d, f, g\\},\) and \(U=\\{a, \ldots, h\\},\) find the binary representation of each set. \(B^{\prime}\)

Using the sets \(A=\\{a, b, e, h\\}, B=\\{b, c, e, f, h |, C=\\{c, d, f, g\\}, \text { and }\) \(U=\\{a, \ldots, h\\},\) find the binary representation of each set. $$ B^{\prime} $$

Define each language \(L\) over the given alphabet recursively. $$L=\left\\{x \in \Sigma^{*} | x=\mathrm{b}^{n} \mathrm{ab}^{n}, n \geq 0\right\\}, \Sigma=\\{\mathrm{a}, \mathrm{b}\\}$$

The language \(L\) of all palindromes over \(\Sigma=\\{a, b\\} .\) (A palindrome is a word that reads the same both forwards and backwards. For instance, abba is a palindrome.)

Using the sets \(A=\\{a, b, e, h\\}, B=\\{b, c, e, f, h |, C=\\{c, d, f, g\\}, \text { and }\) \(U=\\{a, \ldots, h\\},\) find the binary representation of each set. $$ A-B $$

Mark each as true or false. $$\mathbf{b} \subseteq\\{\mathbf{a}, \mathbf{b}, \mathbf{c}\\}$$

Let \(A\) and \(B\) be finite sets such that \(A \subseteq B,|A|=b,|B|=a+b .\) Find the cardinality of each set. \(B-A\)

Define each language \(L\) over the given alphabet recursively. The language \(L\) of all palindromes over \(\Sigma=\\{a, b] .\) (A palindrome is a word that reads the same both forwards and backwards. For instance, abba is a palindrome.)

Mark each as true or false. $$ \mathrm{b} \subseteq\\{\mathrm{a}, \mathrm{b}, \mathrm{c}\\} $$