1,026 views

2 Answers

0 votes
0 votes

Since, the given language is a CFL and complement of CFL is CSL . so answer is D

0 votes
0 votes
It should be D) either it will be csl or recursive

Related questions

299
views
0 answers
1 votes
Prince Sindhiya asked Nov 21, 2018
299 views
divisibility: |w| i.e length of string is divisible by a,b.If a doesn't divide b and b doesn't divide a then Min. states = a*bCase 1 : Divisible by a and b - ... a then Min. states = GCD(a,b)Doubt -> is these all cases are true always ?
488
views
0 answers
0 votes
jatin khachane 1 asked Jan 22, 2019
488 views
First time posting something non technical.Today Madeeasy CBT mock 1 result came and i am very disappointed by my performance.After preparing so sincerely it feels ... very last time.Helpful if some senior person helps on this. :( Thanks
307
views
0 answers
0 votes
ishitasinha asked Jan 10, 2019
307 views
for directed weighted graph with edge weight non negative whether dijakstra will give correct result in every case ???
2.4k
views
0 answers
0 votes
Vishal sakariya asked Nov 4, 2018
2,390 views
How to see my bookmark question ?