InterviewSolution
Saved Bookmarks
| 1. |
If is a language, and is a symbol, then, the quotient of and, is the set of strings such that is in: is in. Suppose is regular, which of the following statements is true?(a) L/a is always a regular language(b) L/a is not a regular language(c) All of the mentioned(d) None of the mentioned |
|
Answer» The correct choice is (a) L/a is always a regular language Explanation: We can build a DFA for as such: firstly we get the DFA for: Then, we copy all the states and transitions to the DFA for. However, we mark any state as a final state in if and only if is a final state in. |
|