# GATE 2004 Question - Marks 5

Total 1 Questions

GateQuestions

ALL GATE QUESTIONS SUBJECTWISE

×
## Regular Language and Finite Automata

1 Mark Questions
2 Marks Questions
5 Marks Questions

## Context Free Language and Pushdown Automata

1 Mark Questions
2 Marks Questions
5 Marks Questions

## Contextsensitive Language And Turing Machine

1 Mark Questions
2 Marks Questions
5 Marks Questions

## Undecidability

1 Mark Questions
2 Marks Questions

(a) Regularity is preserved under the operation of string reversal.

(b) All subsets of regular sets are regular.

(c) A minimal DFA that is equivalent to an NDFA with n nodes has always 2

(d) The intersection of two CFL’s is also CFL.

(e) A is recursive if both a and its complement are accepted by Turing Machine M accepts.

(f) The problem whether Turing Machine M accepts input w is undecidable.

Total 1 Questions

×
## Send Error Report:

Divide & Conquer

Greedy Method

Dynamic Programming

P & NP Concepts

GateQuestions.Com is For Serve The Gate Questions For GATE Students at Free Of Cost..
While using this site, you agree to have read and accepted our terms of use,
cookie and privacy policy.
Copyright 2015 - 2018 by GATEQuestions.Com All Rights Reserved.

## Connect with Us: