Theory of Computation
Quick practice
Question 1 of 5
Which of the following statements is false?
A
Finiteness problem is undecidable for Recursive and Recursively enumerable language.
B
None of the above
C
Membership problem is decidable for Regular language but undecidable for Recursively Enumerable language.
D
Emptiness problem is decidable for Deterministic Context free language but undecidable for Recursive language.
Concepts
Theory of Computation
Language
Types of Finite Automata
Finite Automata
Regular Expression
Regular Grammar
Regular Language
Context Free Grammar
Pushdown Automata
Turing Machine
Recursive Language and REL
Decidability
Get unlimited practice with GATE - CSIT, DSAI & Placements subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go