The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+15 votes

02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:

In which of the cases stated below is the following statement true?

"For every non-deterministic machine $M_{1}$ there exists an equivalent deterministic machine $M_{2}$ recognizing the same language".

- $M_{1}$ is non-deterministic finite automaton.
- $M_{1}$ is non-deterministic PDA.
- $M_{1}$ is a non-deteministic Turing machine.
- For no machines $M_{1}$ and $M_2$, the above statement true.

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.7k
- Digital Logic 2.2k
- Programming & DS 4.1k
- Algorithms 3.6k
- Theory of Computation 4.5k
- Compiler Design 1.7k
- Databases 3.2k
- CO & Architecture 2.8k
- Computer Networks 3.2k
- Non GATE 1.1k
- Others 1.5k
- Admissions 503
- Exam Queries 474
- Tier 1 Placement Questions 22
- Job Queries 61
- Projects 13

39,716 questions

46,751 answers

140,563 comments

58,408 users