Which of the following Boolean expressions is equivalent to \neg (\neg A \vee \neg B) \vee C?

Which of the following would be a valid partition of the set of all strings A^* over the alphabet A = \{a, b\}?

Let A be the alphabet \{a, b\}.

Consider the following function definition.

f: A^* \rightarrow \mathbb{N}_0

f(x) = |x|

Which of the following is true about f?

For this question, suppose the universal set is the set of all strings over the English alphabet.

Let B be a set of book titles representing all books in the catalogue of some bookstore.

Let H be the set of book titles that are currently available at the store in hard cover, and let S be the set of book titles that are currently available in soft cover. (There may be some book titles in the catalogue which are not available at all.)

Let F be the set of fiction book titles in the catalogue.

Write an expression using set notation for the set of non-fiction books in the catalogue that are available either in hardcover, or in softcover, but not in both.

∪    ∩    ∖    △    ×    ∈    ⊂    ⊆    ⊃    ⊇    ⇒    ⇐    ⇔    →    ←    ↔    ∧    ∨    ¬    ⊕

Given the following Boolean expression, use its truth table to construct an equivalent expression in DNF.

\neg (X \vee \neg Y) \wedge (Y \Rightarrow \neg Z) 

Which of the following is a harmonic sequence?

Which of the following gives a complete recursive definition of a sequence?

Let A

be the sequence of strings {“alpha”, “beta”, “gamma”, “delta”, “epsilon”}.

Which of the following is

Let A be the sequence of all positive integers, in ascending order. Which of the following statements, if any, is not true about A?