Describe, as precisely as possible, the language generated by each of the following regular expressions. The...
(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...
lIhg derivation in tion for each of the following Post correspondence systems. 16, Find a solution for each la, aaa), taab, b), [abaa, ab la, abl. tba, aba), lb, aba), [bba, b] 17 Show that the following Post coespondence systems have no solutions a) [b, ba], [aa, bl, [bab, aa], [ab, ba] by [ab, al, [ba, bab], [b, aa], [ba, ab] c) [ab, aba], [baa, aa], [aba, baa] lab, bb], laa, ba), lab, abbl, [bb, bab] e) [abb, ab], [aba,...
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....
• Build an FA that accepts the language of all words with only a’s or only b’s in them. For example, a, aa, aaa, b, bb, bbb, etc are in the language, while null string, ab, ba, aab, aba, bab, bba, baa, etc are not in the language. • Give a regular expression for this language.
7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(((aa 7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(((aa
3. (8) Let L be the language accepted by the following finite state machine: q0 q1 q2 q3 Answer Yes or No: Does each of the following regular expressions correctly describe L? (1) (a uba)bb'a (2) (EU b)a(bb%)* (3) ba u ab*a (4) (a ba)(bb*a)*
4. A regular expression for the language over the alphabet fa, b) with each string having an even number of a's is (b*ab*ab*)*b*. Use this result to find regular expressions for the following languages a language over the same alphabet but with each string having odd number of a's. (3 points) a. b. a language over the same alphabet but with each string having 4n (n >- 0) a's. (3 points)
Question 1 - Regular Expressions Find regular expressions that define the following languages: 1. All even-length strings over the alphabet {a,b}. 2. All strings over the alphabet {a,b} with odd numbers of a's. 3. All strings over the alphabet {a,b} with even numbers of b’s. 4. All strings over the alphabet {a,b} that start and end with different symbols. 5. All strings over the alphabet {a, b} that do not contain the substring aab and end with bb.
Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by
Construct regular expressions for the following languages over the alphabet {a, b}: a. Strings that do not begin with an “a”. b. Strings that contain both aa and bb as substrings.