• 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.
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
• Build an FA that accepts the language of all words with only a’s or only...
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,...
************Theory of Computing ***************** 1. Generate a regular expression of “all words over the alphabet Σ = {a b} that either begin with a and end with b OR begin with b and end in a.” Thus, the first few shortest words in this language are “ab” “ba” “aab” “baa” “abb” “bba” “aaab” etc. So, if a word begins with a it must in end b, and if it begins with b it must end in a. 2. Consider the...
a "language" consists of thrree words, w1=a, w2=ba, w3=bb. let N(k) be number of "sentencces" using exactly k letters ex N(1)=1 (i.e a),N(2)=3 (aa,ba,bb), N(3) =5(aaa,aba,abb,baa,bba) no space is allowed between words. a. show that N(k) = N(k-1) + 2N(k-2) ,k =2,3,... define (N(0)=1) how to proof this?
QUESTION 8 For the following equation, solve for the language L. {a, aa, ab} L = {ab,aab,abb, aa aaa, aba} O L = {bb,aa,a} O L = {b,a} O L = {b,aa} L = {4,b,a} QUESTION 9 Consider the regular expression (a+ab)*(b+ab)* Which of the followings
For a regular language below, write an equivalent regular expression and draw an FA that accepts the language. L = {w ∈ {a,b}*:w contains the substring aba}
-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
Build an FA that accepts only those words in which the ab-substring occurs an even number of times and ends in a b-substring
Let L1 be language((aa + ab + ba + bb) ∗ ) and let L2 be language((a + b) ∗aa(a + b) ∗ ). Find a regular expression and an FA that each define L1∩L2.
Give regular expressions for the following languages: (a) The language of all strings over {a,b} except the empty string. (b) The language of all strings over {a,b} that contain both bab and bba as substrings. (c)L k = {w ∈ {a,b} * | w contains a substring having 3 more b’s than a’s}. (d) The language of all strings over {a,b} that have a b in every odd position (first symbol is considered position 1; empty string should be accepted)...
Construct a regular expression that defines the language L (say) containing all the words with either exactly one aba-substring or exactly one bab-substring but not both aba- and bab-substrings. (Hint: For example, the word abab does not belong to L.)