Please explain the answer shortly! :)
Ans) option D
Explaination:- to find the correct option let us take an example string and try to find which regular expression accepts it.
Let the strings be "1011".and "110" The regular expression we want must not accept any of these string as we want that regular expression that is complement of the expression that accepts string of 0's and 1's such that 1 is always followed by a 0.
option A i.e (0+1)*11(0+1)*. , this expression clearly accepts the string 1011. Therefore ruled out
option B i.e (1+01)* , this expression clearly accepts the string 1011. Therefore ruled out.
option C i.e (0+11)*, this expression clearly accepts the string 110. Therefore ruled out.
option D, i.e (0+1)*1(e + 1(0+1)*), this expression clearly does not accept the example strings that we have taken. Therefore it is the correct option.
Please explain the answer shortly! :) The language of the regular expression (0+10)* is the set...
Can you please thoroughly explain part B? Let Σ {0,1} be an alphabet. Suppose the language Ly is the set of all strings that start with a 1 and L2 is the set of all strings that end in a 1. Describe Lj U L2 and (L1 UL2)* using English. b) Decide if the given strings belong to the language defined by the given regular expression. If it does not belong, then explain why. 0(1|€)10(e|0)*11 , strings: 0110011, 0100011001111
1(a)Draw the state diagram for a DFA for accepting the following language over alphabet {0,1}: {w | the length of w is at least 2 and has the same symbol in its 2nd and last positions} (b)Draw the state diagram for an NFA for accepting the following language over alphabet {0,1} (Use as few states as possible): {w | w is of the form 1*(01 ∪ 10*)*} (c)If A is a language with alphabet Σ, the complement of A is...
3) Construct a regular expression defining each of the following languages over the alphabet {a, b}. (a) L = {aab, ba, bb, baab}; (b) The language of all strings containing exactly two b's. (c) The language of all strings containing at least one a and at least one b. (d) The language of all strings that do not end with ba. (e) The language of all strings that do not containing the substring bb. (f) The language of all strings...
Design a regular language where every sentence has to start with any number of strings 101 (any number is none or more), then repeats 00 any number of times, then repeats 01 at least once. Use regular expression notation. Clarification: alphabet is {0,1}. 'string' is the same as program, but here the programs are written using binary alphabet in a silly language.
(a) Give 2 strings that are members of language specified by the regular expression (0+ 1)∗ but are not members of the language specified by 0∗ + 1∗ . Then give 2 strings that are members of both languages. Assume the alphabet is Σ = {0, 1}. (b) For each of the following languages specified by regular expressions, give 2 strings that are members and 2 strings that are not members (a total of 4 strings for each part). Assume...
1. Use a Regular Expression to define the set of all bit strings of one or more 0's followed by only a 1. 2. Use a Regular Expression to define the set of all bit string of two or more symbols followed by three or more 0's. 3. Are these two grammars the same? a. S-> aSb|ab|λ b. S-> aAb|ab A->aAb|λ 4. Use the process of elimination to find the language of the following FA: (see picture for diagram) 5....
Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}: The language consisting of the set of all bit strings that start with 00 or end with 101 (or both). Syntax The union is expressed as R|R, star as R*, plus as R+, concatenation as RR. Epsilon is not supported but you can write R? for the regex (R|epsilon).
This is discrete mathematics. 1. 5 points] Let T be the set of strings whose alphabet is 10, 1,2,3) such that, in every element of T a. Every 1 is followed immediately by exactly one 0. b. Every 2 is followed immediately by exactly two 0s. c. Every 3 is followed immediately by exactly three 0s. For instance, 00103000 E T.) Find a recursive definition for T 1. 5 points] Let T be the set of strings whose alphabet is...
6. (10 pts) Is L regular? Either prove that it is not regular using pumping lemma, or describe an RE for it. The alphabet of the language is 10,1, +,-) L = { x = y + z | x, y, z are binary integers, and x is the sum of y and z }. For example, strings 1000 = 101 + 11, 0101 = 010 + 11, and 101 = 101 + 0 are in the language, but strings...
List 5 strings that belong to the language defined by this regular expression: 0*1(0*1*)*