in Theory of Computation recategorized by
3,213 views
1 vote
1 vote

Given the following statements:

  1. The power of deterministic finite state machine and non- deterministic finite state machine are same.
  2. The power of deterministic pushdown automaton and non- deterministic pushdown automaton are same.

Which of the above is the correct statement(s)?

  1. Both I and II
  2. Only I
  3. Only II
  4. Neither I nor II
in Theory of Computation recategorized by
3.2k views

1 comment

Ans- B
1
1

2 Answers

1 vote
1 vote
ALL Finite Automata have same expressive power

Determistic CFL(DCFL) is a proper  subset of CFL

so DPDA < NPDA

So, B is Correct
0 votes
0 votes
option B is correct
Answer:

Related questions