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 strings
Which of the following statements is true?
(A)
Both (P1) and (P2) are decidable
(B)
Neither (P1) nor (P2) are decidable
(C)
Only (P1) is decidable
(D)
Only (P2) is decidable
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!