2.
NOTE: As per the HOMEWORKLIB RULESs I should solve only one question. so I can not solve any other questions.
Question 8, please. 2. Prove: (a) the set of even numbers is countable. (b i=1 3....
Question 1: Every language is regular T/F Question 2: There exists a DFA that has only one final state T/F Question 3: Let M be a DFA, and define flip(M) as the DFA which is identical to M except you flip that final state. Then for every M, the language L(M)^c (complement) = L( flip (M)). T/F Question 4: Let G be a right linear grammar, and reverse(G)=reverse of G, i.e. if G has a rule A -> w B...
UueSLIORS! 1. Find the error in logic in the following statement: We know that a b' is a context-free, not regular language. The class of context-free languages are not closed under complement, so its complement is not context free. But we know that its complement is context-free. 2. We have proved that the regular languages are closed under string reversal. Prove here that the context-free languages are closed under string reversal. 3. Part 1: Find an NFA with 3 states...
Could you please answer the question Q1 to Q3. Write the answer
clearly and step by step.
1 Let U = {1, 2, 3, 4, 5, 6, 7} be the universe. Form the set A as follows: Read off your seven digit student number from left to right. For the first digit ni include the number 1 in A if ni is even otherwise omit 1 from A. Now take the second digit n2 and include the number 2 in...