1 / 58

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.

bettyrsmith
Download Presentation

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 COMP 335

  2. Nondeterministic Finite Accepter (NFA) Alphabet = COMP 335

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

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

  5. First Choice COMP 335

  6. First Choice COMP 335

  7. First Choice COMP 335

  8. First Choice All input is consumed “accept” COMP 335

  9. Second Choice COMP 335

  10. Second Choice COMP 335

  11. Second Choice No transition: the automaton hangs COMP 335

  12. Second Choice Input cannot be consumed “reject” COMP 335

  13. An NFA accepts a string w: if there is at least one computation of the NFA that accepts the string w AND all the input is consumed and the automaton is in a final state COMP 335

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

  15. Rejection example COMP 335

  16. First Choice COMP 335

  17. First Choice “reject” COMP 335

  18. Second Choice COMP 335

  19. Second Choice COMP 335

  20. Second Choice “reject” COMP 335

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

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

  23. Rejection example COMP 335

  24. First Choice COMP 335

  25. First Choice No transition: the automaton hangs COMP 335

  26. First Choice Input cannot be consumed “reject” COMP 335

  27. Second Choice COMP 335

  28. Second Choice COMP 335

  29. Second Choice No transition: the automaton hangs COMP 335

  30. Second Choice Input cannot be consumed “reject” COMP 335

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

  32. Language accepted: COMP 335

  33. Lambda Transitions COMP 335

  34. COMP 335

  35. COMP 335

  36. (read head does not move) COMP 335

  37. COMP 335

  38. all input is consumed “accept” String is accepted COMP 335

  39. Rejection Example COMP 335

  40. COMP 335

  41. (read head doesn’t move) COMP 335

  42. No transition: the automaton hangs COMP 335

  43. Input cannot be consumed “reject” String is rejected COMP 335

  44. Language accepted: COMP 335

  45. Another NFA Example COMP 335

  46. COMP 335

  47. COMP 335

  48. COMP 335

  49. “accept” COMP 335

  50. Another String COMP 335

More Related