NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
1

GATE CSE 1998

MCQ (Single Correct Answer)
Regarding the power of recognition of languages, which of the following statement is false?
A
The non-deterministic finite-state automata are equivalent to deterministic finite-state automata.
B
Non-deterministic Push-down automata are equivalent to deterministic Push-down automata.
C
Non-deterministic Turing machines are equivalent to deterministic Turing machines.
D
Multi-tape Turing machines are equivalent to Single-tape Turing machines.
2

GATE CSE 1992

True or False
Which of the following statements is / are true / false?

Regular languages are closed under infinite union.

A
TRUE
B
FALSE
3

GATE CSE 1992

True or False
Which of the following statements is / are true / false?

Union of two recursive languages is recursive

A
TRUE
B
FALSE
4

GATE CSE 1992

True or False
Which of the following statements is / are true / false?

The language $$\left\{ {{0^n}\,\left| {\,n} \right.} \right.$$ is prime$$\left. \, \right\}$$ is not regular

A
TRUE
B
FALSE
Write for Us

Do you want to write for us? Help us by contributing to our platform.

Questions Asked from Recursively Enumerable Language and Turing Machine

On those following papers in Marks 1
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2022 (2)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2013 (1)
GATE CSE 2008 (1)
GATE CSE 2003 (2)
GATE CSE 1998 (1)
GATE CSE 1992 (3)

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12