Which of the following are decidable?
1. Whether the intersection of two regular languages is infinite
2. Whether a given context-free language is regular
3. Whether two push-down automata accept the same language
4. Whether a given grammar is context-free
(A) 1 and 2 (B) 1 and 4
(C) 2 and 3 (D) 2 and 4
The answer to the question is available in the PDF file https://assignmentexpert.com/https://assignmentexpert.com/homework-answers/mathematics-answer-38163.pdf
Comments
Dear Sujata Roy You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!
Thank you.
Leave a comment