a) {aibici|i>=0}
b) {ss|s∈{a,b}*}
c) The set legal C programs
d) None of the mentioned
Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!