Lecture 10 : regular expression containing substring , not containing substring 00 , 101 automata

how to define regular expression containing substring or regular expression not containing substring 00 , 101 in urdu tutorial regular expression that does not contain a string regular expression not containing substring 101 Define a RE for language that contains the substring ba regular expression containing string in urdu automata regular expression containing substring regular expression not containing substring regular expression containing substring regular expression containing string regular expression containing substring 00 dfa does not contain substring 011 the set of all strings containing 1101 as a substring All strings which do not contain the substring ba regular expression containing special characters regular expression containing two words regular expression not containing substring 101 dfa does not contain substring 101 dfa does not contain substring 110 {w| w does not contain the substring ab} All strings which do not contain the substring 101 dfa substring regular expression not containing substring 00 dfa for strings ending with 101 design a dfa which accepts set of all strings that begins with 01 and end with 11. regex does not contain character regular expression not containing substring 00 regex contains character regex does not contain multiple words regex contains string regex tester regex negative lookahead Programology Write a regular expression and give the corresponding automata for each of the following sets of binary strings. Use only the basic operations. 1. 0 or 11 or 101 0 | 11 | 101 2. only 0s 0* 3. all binary strings (0|1)* 4. all binary strings except empty string (0|1)(0|1)* 5. begins with 1, ends with 1 1 | (0|1)*|1 6. ends with 00 (0|1)*00 7. contains at least three 1s (0|1)*1(0|1)*1(0|1)*1 8. contains at least three consecutive 1s (0|1)*111(0|1)* 9. contains the substring 110 (0|1)*110(0|1)* 10.doesn't contain the substring 110 (0|10)*1* 11.contains at least two 0s but not consecutive 0s (1*011*(0+011*))* 12.has at least 3 characters, and the third character is 0 (0|1)(0|1)0(0|1)* 13.number of 0s is a multiple of 3 1*|(1*01*01*01)* 14.starts and ends with the same character 1(0|1)*1|0(0|1)*0 15.odd length (0|1)((0|1)(0|1))* 16.starts with 0 and has odd length, or starts with 1 and has even length 0((0|1)(0|1))*|1(0|1)((0|1)(0|1))* 17.length is at least 1 and at most 3 (0|1)|(0|1)(0|1)|(0|1)(0|1)(0|1) Exercise 2: For each of the following, indicate how many bit strings of length exactly 1000 are matched by the regular expression: 0(0 | 1)*1, 0*101*, (1 | 01)*. What is the regular expression of a string not containing 101 as a every string must not contain a substring 'abb' Set of Binary Strings that do not contain 001 as Substring Regular Expression contain Substring 100 Regular expression to match string of 0's and 1's without '011 Consider the following non-deterministic finite automaton (NFA) over the alphabet Σ = {0,1}. Give a one-sentence description of the language recognized by the NFA. Write a regular expression for this language. The NFA recognizes all strings that contain two 0's separated by a substring whose length is a multiple of 3. Design finite state automata and regular expressions for the following languages: LЕ = {w : w does not contain the substring 110}. L2 = {w : w contains an even The expression +0+1 describes the strings with length zero or one, and the expression (0 + ... All strings not containing the substring 101: 0*(1*000*)*1*0* By: Ali Hassan Soomro Facebook: www.facebook.com/AliiHassanSoomro Gmail: [email protected]