GATE CSE Turing Machines, RE Languages & Undecidability – TOC Practice Test

GATE CSE Turing Machines, RE Languages & Undecidability – TOC Practice Test | Set 1

Questions 26-30 of 100

0% completed (0/100 answered)

Question 26

MCQ · Single Correct 1 mark

Which statement about DCFLs is correct?

A They are equal to all CFLs B They are not contained in CFLs C They are not recursive D They are closed under complement

Question 27

MCQ · Single Correct 1 mark

Which statement about CFL closure under union is correct?

A CFL is closed under union B CFL is not closed under union C CFL is closed only for finite languages D CFL is closed only under complement

Question 28

MCQ · Single Correct 1 mark

Which statement about CFL closure under intersection is correct?

A CFL is closed under arbitrary intersection B CFL is not closed under arbitrary intersection C CFL is closed only under complement D CFL equals DCFL under intersection

Question 29

MCQ · Single Correct 1 mark

Which class is closed under both union and intersection?

A DCFL only B RE only under complement C Recursive languages D CFL only

Question 30

MCQ · Single Correct 1 mark

What is the standard containment relation between DCFL and CFL?

A CFL is a proper subset of DCFL B They are incomparable C They are equal D DCFL is a proper subset of CFL