1 / 48

Lecture 2 Theory of Computation

Lecture 2 Theory of Computation. Yasir Imtiaz Khan. Finite automata. Finite automata . Formal definition. Draw state diagrams. Transition Graph. Abba -Finite Accepter. initial state. final state “accept”. transition. state. Initial Configuration. Input String.

idola
Download Presentation

Lecture 2 Theory of Computation

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. Lecture 2Theory of Computation Yasir Imtiaz Khan

  2. Finite automata

  3. Finite automata

  4. Formal definition

  5. Draw state diagrams

  6. Transition Graph Abba -Finite Accepter initial state final state “accept” transition state

  7. Initial Configuration Input String

  8. Reading the Input

  9. Input finished Output: “accept”

  10. Rejection

  11. Input finished Output: “reject”

  12. Another Rejection

  13. Output: “reject”

  14. More Examples trap state accept

  15. = { all strings with prefix } accept

  16. = { all strings without substring }

  17. Non Deterministic Automata

  18. Formal definition NFA

  19. Nondeterministic Finite Accepter (NFA) Alphabet =

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

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

  22. First Choice

  23. First Choice

  24. First Choice

  25. First Choice All input is consumed “accept”

  26. Second Choice

  27. Second Choice

  28. Second Choice No transition: the automaton hangs

  29. Second Choice Input cannot be consumed “reject”

  30. Lambda Transitions

  31. (read head does not move)

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

  33. Rejection Example

  34. (read head doesn’t move)

  35. No transition: the automaton hangs

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

  37. Language accepted:

  38. Another NFA Example

More Related