1 / 85

Understanding Nondeterministic Finite Acceptor (NFA)

Learn about Nondeterministic Finite Acceptor (NFA) that uses two choices for acceptance or rejection based on computations. NFA consumes input and can hang or reject. Explore examples and computations leading to acceptance or rejection.

cree
Télécharger la présentation

Understanding Nondeterministic Finite Acceptor (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. Non Deterministic Automata

  2. Nondeterministic Finite Accepter (NFA) Alphabet =

  3. Nondeterministic Finite Accepter (NFA) Alphabet = Two choices

  4. Nondeterministic Finite Accepter (NFA) Alphabet = Two choices No transition No transition

  5. First Choice

  6. First Choice

  7. First Choice

  8. First Choice All input is consumed “accept”

  9. Second Choice

  10. Second Choice

  11. Second Choice No transition: the automaton hangs

  12. Second Choice Input cannot be consumed “reject”

  13. An NFA accepts a string: when there is a computation of the NFA that accepts the string • All the input is consumed and the automaton • is in a final state

  14. Example is accepted by the NFA: “accept” “reject” because this computation accepts

  15. Rejection example

  16. First Choice

  17. First Choice “reject”

  18. Second Choice

  19. Second Choice

  20. Second Choice “reject”

  21. An NFA rejects a string: when there is no computation of the NFA that accepts the string • All the input is consumed and the • automaton is in a non final state • The input cannot be consumed

  22. Example is rejected by the NFA: “reject” “reject” All possible computations lead to rejection

  23. Rejection example

  24. First Choice

  25. First Choice No transition: the automaton hangs

  26. First Choice Input cannot be consumed “reject”

  27. Second Choice

  28. Second Choice

  29. Second Choice No transition: the automaton hangs

  30. Second Choice Input cannot be consumed “reject”

  31. is rejected by the NFA: “reject” “reject” All possible computations lead to rejection

  32. Language accepted:

  33. Lambda Transitions

  34. (read head doesn’t move)

  35. all input is consumed “accept” String is accepted

  36. Rejection Example

  37. (read head doesn’t move)

  38. No transition: the automaton hangs

  39. Input cannot be consumed “reject” String is rejected

  40. Language accepted:

  41. Another NFA Example

  42. “accept”

  43. Another String

More Related