# GATE 1998 Question - Mark 1

Total 7 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) The non-deterministic finite-state automata are equivalent to deterministic finite-state automata.

(b) Non-deterministic Push-down automata are equivalent to deterministic Pushdown automata.

(c) Non-deterministic Turing machines are equivalent to deterministic Push-down automata.

(d) Non-deterministic Turing machines are equivalent to deterministic Turing machines.

(e) Multi-tape Turing machines are equivalent to Single-tape Turing machines

Total 7 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: