Q. Consider the following decision problems:(P1) Does a given finite state machine accept a given string(P2) Does a given context free grammar generate an infinite number of stingsWhich of the following statements is true? (Solved)
1. Both (P1) and (P2) are decidable
2. Neither (P1) nor (P2) are decidable
3. Only (P1) is decidable
4. Only (P2) is decidable
- a. Both (P1) and (P2) are decidable