[Solved]4 Q1 Language Regular Ifselect Apply Itis Non Empty Set Strings Alphabet Strings Langauge Q37121748
4 Q1: A language is regular ifSelect all that apply. itis a non-empty set of strings over an alphabet All strings in the langauge are accepted by a DFA and this DFA accepts nothing not in the langauge All strings in the langauge are accepted by an NFA and this NFA accepts nothing not in the langauge. it is the empty set Q2: Which of the following are regular languages? Select all that apply. (0011) 1-01 (101(0) 03: Let the top DFA be a DFA for language L1 and let the bottom NFA be an NFA for L2. How do L1 and L2 relate to each other? Select all that apply Hint: an odd number plus an even number is an odd number. OL1-12 L1 is a subset of L2 The complement of L1 is diasjoint from L2 L1 is a subset of the complement of L Q5: Say you have an NFA N. Which of the following operations on the state diagram will result in another NFA (not necessarily for the same language). remove edges add edges with symbols from the same alphabet add a state Show transcribed image text 4 Q1: A language is regular ifSelect all that apply. itis a non-empty set of strings over an alphabet All strings in the langauge are accepted by a DFA and this DFA accepts nothing not in the langauge All strings in the langauge are accepted by an NFA and this NFA accepts nothing not in the langauge. it is the empty set Q2: Which of the following are regular languages? Select all that apply. (0011) 1-01 (101(0) 03: Let the top DFA be a DFA for language L1 and let the bottom NFA be an NFA for L2. How do L1 and L2 relate to each other? Select all that apply Hint: an odd number plus an even number is an odd number. OL1-12 L1 is a subset of L2 The complement of L1 is diasjoint from L2 L1 is a subset of the complement of L Q5: Say you have an NFA N. Which of the following operations on the state diagram will result in another NFA (not necessarily for the same language). remove edges add edges with symbols from the same alphabet add a state
Expert Answer
Answer to 4 Q1: A language is regular ifSelect all that apply. itis a non-empty set of strings over an alphabet All strings in the… . . .
OR
