Extra Education
← All Theory of Computation and Compiler Design questions
1

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 stings Which of the following statements is true?

Correct Answer: Both (P1) and (P2) are decidable

Make the most of this question

This page focuses on one Theory of Computation and Compiler Design question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation and Compiler Design MCQsAll Engineering topicsMock test hub
Theory of Computation and Compiler Design MCQ: 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 stings Which of the following statements is true? | Extra Education