1 / 78

Non-Deterministic Finite Automata

This guide explores Non-Deterministic Finite Automata (NFA), focusing on how they accept or reject strings. An NFA can have multiple paths for input processing, leading to acceptance when at least one computation consumes all input and ends in an accepting state. Conversely, rejection occurs if there's no valid computation that leads to acceptance. Key examples illustrate these concepts, emphasizing the roles of choices, transitions, and the significance of the input. Understanding these principles is crucial for applications in computational theory and automata.

veata
Télécharger la présentation

Non-Deterministic Finite 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 Finite Automata

  2. Nondeterministic Finite Automaton (NFA) Alphabet =

  3. Alphabet = Two choices

  4. 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 There is a computation: all the input is consumed and the automaton is in an accepting 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. For each computation: • All the input is consumed and the • automaton is in a non final state OR • 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 does not 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