1 / 113

Non Deterministic Automata

Non Deterministic Automata. Nondeterministic Finite Accepter (NFA). Alphabet =. Nondeterministic Finite Accepter (NFA). Alphabet =. Two choices. Nondeterministic Finite Accepter (NFA). Alphabet =. Two choices. No transition. No transition. First Choice. First Choice. First Choice.

albertlong
Télécharger la présentation

Non Deterministic Automata

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 Costas Busch - RPI

  2. Nondeterministic Finite Accepter (NFA) Alphabet = Costas Busch - RPI

  3. Nondeterministic Finite Accepter (NFA) Alphabet = Two choices Costas Busch - RPI

  4. Nondeterministic Finite Accepter (NFA) Alphabet = Two choices No transition No transition Costas Busch - RPI

  5. First Choice Costas Busch - RPI

  6. First Choice Costas Busch - RPI

  7. First Choice Costas Busch - RPI

  8. First Choice All input is consumed “accept” Costas Busch - RPI

  9. Second Choice Costas Busch - RPI

  10. Second Choice Costas Busch - RPI

  11. Second Choice No transition: the automaton hangs Costas Busch - RPI

  12. Second Choice Input cannot be consumed “reject” Costas Busch - RPI

  13. An NFA accepts a string: when there is a computation of the NFA that accepts the string AND all the input is consumed and the automaton is in a final state Costas Busch - RPI

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

  15. Rejection example Costas Busch - RPI

  16. First Choice Costas Busch - RPI

  17. First Choice “reject” Costas Busch - RPI

  18. Second Choice Costas Busch - RPI

  19. Second Choice Costas Busch - RPI

  20. Second Choice “reject” Costas Busch - RPI

  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 OR • The input cannot be consumed Costas Busch - RPI

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

  23. Rejection example Costas Busch - RPI

  24. First Choice Costas Busch - RPI

  25. First Choice No transition: the automaton hangs Costas Busch - RPI

  26. First Choice Input cannot be consumed “reject” Costas Busch - RPI

  27. Second Choice Costas Busch - RPI

  28. Second Choice Costas Busch - RPI

  29. Second Choice No transition: the automaton hangs Costas Busch - RPI

  30. Second Choice Input cannot be consumed “reject” Costas Busch - RPI

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

  32. Language accepted: Costas Busch - RPI

  33. Lambda Transitions Costas Busch - RPI

  34. Costas Busch - RPI

  35. Costas Busch - RPI

  36. (read head does not move) Costas Busch - RPI

  37. Costas Busch - RPI

  38. all input is consumed “accept” String is accepted Costas Busch - RPI

  39. Rejection Example Costas Busch - RPI

  40. Costas Busch - RPI

  41. (read head doesn’t move) Costas Busch - RPI

  42. No transition: the automaton hangs Costas Busch - RPI

  43. Input cannot be consumed “reject” String is rejected Costas Busch - RPI

  44. Language accepted: Costas Busch - RPI

  45. Another NFA Example Costas Busch - RPI

  46. Costas Busch - RPI

  47. Costas Busch - RPI

  48. Costas Busch - RPI

  49. “accept” Costas Busch - RPI

  50. Another String Costas Busch - RPI

More Related