Give a string not in the language described by (010)∗+0100∗ that is accepted by the student's NFA.

Which of the following is the corresponding Language to the given DFA? L= {x ϵ {0,1} |x ends in 1 and does not contain substring 10}L= {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}

Which language accepted by the regular expression (0+1)*0(0+1)*0(0+1)*.Select one:a. The set of all strings containing at least two 0’s.b. The set of all strings that begin and end with either 0 or 1.c. The set of all strings containing at most two 0’s.d. The set of all strings containing the substring 00.

You have a regular expression: (01 + 10)*. Which of the following strings is in the language defined by this regular expression?

Design a PDA for the language consisting of strings with more 0's than 1's.

Give English descriptions of the language described by each of the following regularexpressions:1. (1 + ε) (00*1)*0*