2.8.2024
Question 1: The cartesian product of two DFAs is commonly used to construct a single DFA for the ________ of two regular Languages.
(3 points)
A. complement
B. intersection
C. union
D. symmetric difference
Answer
B. intersectionQuestion 2: For which of the following regular languages would it be easier to build a DFA of its complement first? Assume $\Sigma = \{0, 1\}$. (3 points)
A. $\{w|w \text{ starts with a 0 and ends with a 0}\}$
B. $\{w|w \text{ has exactly two 1’s}\}$
C. $\{w|w \text{ does not have 010 nor 110 as substrings}\}$
D. $\{w|w \text{ has at least one 0}\}$
Answer
C. $\{w|w \text{ does not have 010 nor 110 as substrings}\}$Question 3: Which of the following would be the appropriate operation to implement (via an NFA) if one want to recognize a repeating substring of any size?
(3 points)
A. union
B. intersection
C. star operation ($^{*}$)
D. complement