QUESTION 8 For the following equation, solve for the language L. {a, aa, ab} L =...
please answer 17c and 17d. 17. Show that the following Post correspondence systems have no solutions. a) [b, ba], [aa, b], [bab, aa], [ab, ba] b) [ab, a]. [ba, bab], [b, aa], [ba, ab] c)lab, aba] lbaa, aa]. [aba. baal (dy [ab, bb], [aa, ba]. [ab, abb]. [bb, bab] e) [abb, ab], [aba, ba], [aab, abab] 17. Show that the following Post correspondence systems have no solutions. a) [b, ba], [aa, b], [bab, aa], [ab, ba] b) [ab, a]. [ba,...
• 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.
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,...
Find an NFA that decides L(aa (ab)). Present a regular expression for the language LR.
Describe, as precisely as possible, the language generated by each of the following regular expressions. The alphabet is {a, b} (1) (aaa)* b(bb)* (2) abab(ab)* (3) b (e U a) b (4) a(aa) (bb)* UE*baa
Evaluate the following language expression: BE Use your wits to solve the following language expression for the unknown language (L): EL = { a, ab, abx, b, bb, bx, bbx}
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
Convert this language to a NFA L(ab(a+b)*(a+aa)) Answer: the graph is as follows: Question: How do you know when to insert lambda? Will give thumbs up :) 8 7 5 4 0
-Find a left-linear grammar for the language L((aaab*ba)*). -Find a regular grammar that generates the language L(aa* (ab + a)*).-Construct an NFA that accepts the language generated by the grammar.S → abS|A,A → baB,B → aA|bb
Find a dfa that accept the following language L((aa∗)∗ + abb)