GATE CS Theory of Computation questions
Practise Theory of Computation questions for GATE CS. Explore official PYQs and original subject-wise quizzes, check answers and view available solutions. Free, no sign-in.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
9 on this page
Which of the following problems are undecidable?
Context-free languages and regular languages are both closed under the operation (s) of :
State whether the following statements are TRUE or FALSE: The problem as to whether a Turing machine accepts input is undecidable.
State whether the following statement are TRUE or FALSE. is recursive if both and its complement are accepted by Turing machines.
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
State whether the following statements are TRUE or FALSE: A minimal DFA that is equivalent to an NDFA with nodes has always states.
State whether the following statements are TRUE or FALSE: Regularity is preserved under the operation of string reversal.
State whether the following statements are TRUE or FALSE: All subsets of regular sets are regular.
FORTRAN is a: