a)
Start ->AbAbA
A->a|b|ε
b)
S->aSa ∣ bSb ∣ a ∣ b ∣ϵ
c)
S -> Bb | RS | SRB (all the possible cases) B -> Bb | ϵ (to have more number of B's) R -> RR | aRb | bRa | ϵ (all the balanced string)
d)
S -> Pb
P-> aPb | aabb (as n>=2)
e)
this can be broken down into (a^n b^2n) (b^2m c^m)
S->AB
A-> aAbb | ϵ (a^n b^2n)
B-> bbBc | ϵ (b^2m c^m)
Give context-free grammars that generate the following languages (E = {a,b}). (a) (1 point) L1 =...
Construct context-free grammars that generate each of these languages: A. tw E 10, 1 l w contains at least three 1s B. Hw E 10, 1 the length of w is odd and the middle symbol is 0 C. f0, 1 L fx l x xR (x is not a palindrome) m n. F. w E ta, b)* w has twice as many b's as a s G. a b ch 1, J, k20, and 1 or i k
Problem 2 (20 points). Give context-free grammars that generate the following languages. In all parts, the alphabet Sis {0, 1} 1. {w w contains at least two Os} 2. {ww contains a substring 010) 3. {w w starts and ends with the same symbol} 4. {ww = w that is, w is a palindrome }
can somebody answer this question? Give the Context Free Grammars which generate the following languages: a) La = {w ∈ {0, 1} ∗ : w has at least twice as many zeroes as ones }.
Give context-free grammars that generate the following languages. { anw | w in { a, b }*, |w| = 2n, n > 0 } { an bm | n, m ≥ 0; n < 2m } { anx an y | n > 0, x,y in { a, b }* } { ai bj ck | i, j, k ≥ 0; j = i + k }
Formal Languages and Automata Theory Q2. Give context-free grammars that generate the following language: { w є {0, 1} | w contains at least three 1's)
Write the context-free grammars which generate the following languages: a. ?={?∈{?,?}∗ | ? is an odd length string}
1. Construct a DFA that recognizes each of the following languages: a. L1 = {w € {a, b}* | w contains at least two a's and at least two b’s} b. L2 = {w € {a,b}* | w does not contain the substring abba} C. L3 = {w € {a, b}* | the length of w is a multiple of 4}
Give context-free grammars for the following languages: (b) {w € {a,b}* : na(w) # 2n6(w)}
Give context-free grammars to generate the following languages. Each CFG should have at most two variables.
give context free grammer for this language 1. 35 Points] Give context-free grammars for the following languages: (c) wEfa, b, c}* : |w = 5na(w) +2n(w)}