in Theory of Computation
337 views
0 votes
0 votes
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
in Theory of Computation
337 views

1 Answer

3 votes
3 votes
Best answer

L={anbn } - {a13b13}

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

selected by

2 Comments

Plz explain...
0
0

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..

1
1