1,292 views

3 Answers

Best answer
1 votes
1 votes
I think it is

S$\rightarrow$ abA|baA|bbA|aaA

A $\rightarrow$ aAa|bAb|aXa|bXb

X $\rightarrow$ab| ba|aa|bb
selected by
1 votes
1 votes

the question itself says that it is REGULAR (BOUNDED) i.e u,v are bounded with lenght '2' ,BUT  they are not infinate in lenght

and more over to  figure out this is CFL or  not, simlpy look at the  V W VR ,

if V Vis present then it would be an NCFL,BUT its in the form of V W Vwhere W is of 2 lenght string which separates 

Related questions

1 votes
1 votes
2 answers
4
Ayush Upadhyaya asked Mar 19, 2017
2,090 views
Give a context-free grammar for the language below :(n>=0, m>=0)L= { w ∊ {a,b}* : na(w)=2nb(w)+1}