657 views
4 votes
4 votes

Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: 
L := {xy | x, y ∈ Σ* , na(x) = nb(y)} 
What can we say about L?

   
   
 

(A) L is regular, but not context-free.

 

(B) L is context-free, but not regular.

 

(C) L is Σ*.

 

(D) None of these.

1 Answer

0 votes
0 votes
Option B

Na=Nb require comparison

So a wrong

Related questions

1 votes
1 votes
1 answer
2
Sahil1994 asked Dec 7, 2017
551 views
Hi mates,Please Identify Class of grammr with suitable Explanation,1) L={WXW,/ W,X{a,b}*}2) L={WXW,/ W,X{a,b}+}3) L={WXWY,/ W,X,Y{a,b}+}4)L={WXYW,/ W,X,Y{a,b}+}Thanks,
1 votes
1 votes
2 answers
3