1 / 6

Equivalence of NFAs & DFAs: Constructing DFA from NFA

Learn how to prove equivalence between NFAs and DFAs and construct a DFA from an NFA to accept the same language. The step-by-step process is explained with proofs for any input string.

mika
Télécharger la présentation

Equivalence of NFAs & DFAs: Constructing DFA from NFA

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Equivalence of NFAs & DFAs

  2. Extended transition fn NFAs

  3. Proving equivalence

  4. Construct DFA Dfrom NFA N • N = (QN,,N,q0,N,FN) • Construct D= (QD,,D,q0,D,FD) such that, • for any string w  *, • w is accepted by N iff w is accepted by M

  5. Construction continued • QD = 2QN • q0,D = -close(q0,N) • FD = { q  QD | q  FN  }

  6. Proof that construction works • for any string w  *, • w is accepted by N iff w is accepted by D • Or, need to show that:

More Related