PREVIOUS YEAR SOLVED PAPERS - December 2015 Paper 3
(2) 
(3) 
(4) 
- Option : B
- Explanation : The family of context-sensitive languages is not closed under union and not closed under reversal.
You must be logged in to post a comment.
You must be logged in to post a comment.
| List I | List II |
| (a) {an bn | n > 0} is a deterministic context free language | (i) but not recursive language |
| (b) The complement of {an bn an | n> 0} is a context free language | (ii) but not context free language |
| (c) {an bn an} is context sensitive language | (iii) but can not be accepted by a deterministic push down automation |
| (d) L is a recursive language | (iv) but not regular |
Codes:
| Â | (a) | (b) | (c) | (d) |
| (1) | (i) | (ii) | (iii) | (iv) |
| (2) | (i) | (ii) | (iv) | (iii) |
| (3) | (iv) | (iii) | (ii) | (i) |
| (4) | (iv) | (iii) | (i) | (ii) |
- Option : D
- Explanation :
- {anbn | n > 0 } is a deterministic context free language but not regular language
- The complement of {anbnan| n > 0 } is context free language but not accepted by deterministic pushdown automata
- {anbnan} is a context sensitive language but not recursive language
- L is a recursive language but not a context free language
So, option (D) is correct.
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : C
- Explanation : The production: S → aS|Sa|a will generate
So, option (C) is correct
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : C
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.