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.2k
- Engineering Mathematics 4.9k
- Digital Logic 2k
- Programming & DS 3.6k
- Algorithms 3k
- Theory of Computation 3.9k
- Compiler Design 1.5k
- Databases 2.9k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 949
- Others 1.3k
- Admissions 408
- Exam Queries 419
- Tier 1 Placement Questions 17
- Job Queries 55
- Projects 9

34,780 questions

41,755 answers

118,923 comments

41,399 users