Home
SELF STUDY
BrowsePracticeTestsPlaylistDoubts & solutionsFree live classesOther courses

Theory of Computation

Quick practice

Question 1 of 5

Which of the following statements is false?

A

Emptiness problem is decidable for Deterministic Context free language but undecidable for Recursive language.

B

Membership problem is decidable for Regular language but undecidable for Recursively Enumerable language.

C

None of the above

D

Finiteness problem is undecidable for Recursive and Recursively enumerable language.

Concepts

Get unlimited practice with GATE - CSIT, DSAI & Placements subscription

pick

Boost your performance with adaptive practice tests

pick

Practice every concept in the syllabus

pick

Compare your speed and accuracy with your peers

pick

Download the app and practice on the go