recategorized by
3,245 views
1 votes
1 votes

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
recategorized by

2 Answers

1 votes
1 votes
ALL Finite Automata have same expressive power

Determistic CFL(DCFL) is a proper  subset of CFL

so DPDA < NPDA

So, B is Correct
Answer:

Related questions

2 votes
2 votes
2 answers
1
go_editor asked Jul 7, 2016
4,993 views
Match the following :$\begin{array} {clcl} \text{(i)}& \text{Regular grammer} & \text{(a)} & \text{Pushdown automaton} \\ \text{(ii)}& \text{Context free grammer} & \tex...
3 votes
3 votes
1 answer
2
1 votes
1 votes
1 answer
4