# Context Free Grammar

0 votes
102 views
L={a^nb^n;n>=0,n!=13} is

a.DCFL

b.CFL but not DCFL

c.not CFL

d.a recursive set but not CFL

## 1 Answer

3 votes

Best answer

L={anbn } - {a13b13}

which is DCFL - Regular and that results DCFL...

selected by
0
Plz explain...
1

what do i need to explain ?

hope you know anbn is DCFL...it's most basic DCFL...everything is determined so DCFL..

a13b13 : finite so regular...

L-regular is always of type L...closure property..

## Related questions

0 votes
1 answer
1
44 views
Is 0^n 1^n 0^n 1^n where n>=0 a CFG ? Its given that its not CFG , please explain how ?
0 votes
1 answer
2
52 views
L=0^i 1^j 2^k | i=j or j=k is the grammar DCFG?
0 votes
0 answers
3
106 views
Consider the following CFG 'G' S--> aA/bSS/SS A--> aAb/bAa/AA/ε The language generated by G is: a)Set of all strings with atleast one 'a' b)Set of all strings with atleast two a's c)Set of all strings with atleast one more 'a' than number of b's d)None of these
0 votes
0 answers
4
91 views