
i am done perfectly anything
doubtful or not understand just comment I will touch with you
Please thumsup for my effort
Thank you and all the best
3. Decide whether the following language is a CFL. If your answer is “yes”, construct a...
Prove if the following languages are CFL or not.
If L is a CFL, give its
CFG. Otherwise, prove it by Pumping Lemma.
If any closure property of
CFL is applicable, apply them to simplify it before its proof.
L = {wwRw | w {a,
b}*}
L =
{anbjanbj|
n >= 0, j >= 0}
L =
{anbjajbn|
n >= 0, j >= 0}
Is the following language context free or not? (prove / disprove using pumping lemma for CFL ) L = {0n 1 0n | n >= 1}
Determine whether the following language is CFG(context free language) If its not prove by pumping lemma L2 = { an | where n is a power of 2}
Determine whether the following language is CFG(context free language) If its not prove by pumping lemma L1 = {anbmck dr | 2n = 3k and 5m = 7r}
5.) Is the following language context free or not? (prove / disprove using pumping lemma for CFL ) L = {0n 1 0n | n >= 1}
John Doe claims that the language L, of all strings over the alphabet Σ = { a, b } that contain an even number of occurrences of the letter ‘a’, is not a regular language. He offers the following “pumping lemma proof”. Explain what is wrong with the “proof” given below. “Pumping Lemma Proof” We assume that L is regular. Then, according to the pumping lemma, every long string in L (of length m or more) must be “pumpable”. We...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it, and prove your answer. (Hint: a finite state automata is less powerful than a pushdown automata, which in turn is less powerful than a Turing Machine.) For example, to prove a language needs a PDA to accept it, you would use the Pumping Lemma to show it is not regular, and then build the PDA or CFG that...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it, and prove your answer. (Hint: a finite state automata is less powerful than a pushdown automata, which in turn is less powerful than a Turing Machine.) For example, to prove a language needs a PDA to accept it, you would use the Pumping Lemma to show it is not regular, and then build the PDA or CFG that...
Give a context free grammar for the language L where L = {a"bam I n>:O and there exists k>-o such that m=2"k+n) 3. Give a nondeterministic pushdown automata that recognizes the set of strings in L from question 3 above. Acceptance should be by accept state. 4. 5 Give a context-free grammar for the set (abc il j or j -k) ie, the set of strings of a's followed by b's followed by c's, such that there are either a...
3. Use the pumping lemma to prove the following language is not regular . Use the pumping lemma to prove the following language is not regular Where is the stringwbut with all the Os replaced by Is and all the し1 = {te E Σ.ead I te _ wu) is replaced by 0s. For example, if w = 00110 then w = 11001.