Shared publicly  - 
 
Answered: GATE2013_41 - There is an algorithm to check whether the given CFG is empty, finite or infinite and also to convert NFA to DFA hence 1 and 4 are decidable
1
Add a comment...