Give concise word descriptions of the sets denoted by the
following regular
expressions:
(a) (0+1)*010(0+1)*
(b) (0 +11)*(1 + λ)
(c) 00(11*)(00*)
(d) (11 + 111 + 11111)*
Give concise word descriptions of the sets denoted by the following regular expressions: (a) (0+1)*010(0+1)* (b)...
Give English descriptions of the languages represented by the following regular expressions. The descriptions should be simple, similar to how we have been defining languages in class(e.g., “languages of binary strings containing 0 in even positions. . .”). Note: While describing your language, you don’t want to simply spell out the conditions in your regular expressions. E.g., if the regular expression is 0(0 + 1)∗, an answer of the sort “language of all binary strings that start with a 0”...
Determine whether the string 11010 is in each of these sets: a. {1} {0} {110} b. {11} {λ} {010} c. {1} {00} * {010}
4. Convert the following regular expressions to e-NFA's. (a) 1(0110)0(11 10) (b) (000)(011+001) (111) (c) (01 10(00 11)(1 10 100)
Regular expressions, DFA, NFA, grammars, languages Regular Languages 4 4 1. Write English descriptions for the languages generated by the following regular expressions: (a) (01... 9|A|B|C|D|E|F)+(2X) (b) (ab)*(a|ble) 2. Write regular expressions for each of the following. (a) All strings of lowercase letters that begin and end in a. (b) All strings of digits that contain no leading zeros. (c) All strings of digits that represent even numbers. (d) Strings over the alphabet {a,b,c} with an even number of a's....
Find a regular grammar for each of the following : a. 1 + 01 b. 1*01* + 01 c. {00, 10, 01} d. {Λ, 0, 1, 00, 11, … 0n, 1n, (01)n, …} e. All strings which have an odd number of 1’s
Give regular expressions generating the languages of 1. {w over the alphabet of {0, 1} | w is any string except 11 and 111} 2. {w over the alphabet of {0, 1} | w contains at least two 0’s and at most one 1} 3. {w over the alphabet of {0, 1} | the length of w is at most 9} 4. {w over the alphabet of {0, 1} | w contains at least three 1 s} 5. {w over...
3" (25%) Give regular expressions for the following languages on {a, b). (a) L,-(a"b": n 4, m 3) (b) The complement of Li. (c) L- (w: w mod 3 03. Note: lw: the length of w (d) L3 w: |w mod 30 naww) appear) 3" (25%) Give regular expressions for the following languages on {a, b). (a) L,-(a"b": n 4, m 3) (b) The complement of Li. (c) L- (w: w mod 3 03. Note: lw: the length of w...
Webber Chap. 7 Exercise 2 For each of these regular expressions, give two NFAs: the exact one constructed by the proof of Lemma 7.1, and the smallest one you can think of. d. 0 + 1 e. (00)* f. ab*
1. Complete the following exercises a) For Σ = {a, b} find regular expressions for the compliment of the following languages L = L(aa*bb) b) Let Li = L(ab*aa), L2 = L(a"bba"). Find a regular expression for (L1 n Ljl2. c) The symmetric difference of two sets Sı and S2 is defined as sı Θ s,-(x : x E Si or x E S2 but x is not in both S1 and S2). Show that the family of regular languages...
4) (9 pts) Give regular expressions for the following languages on (la, b) a) L1 = { w : na(w) mod 3 = 1). b) L2w w ends in aa) c) L3 = all strings containing no more than three a's.