Download
slide1 n.
Skip this Video
Loading SlideShow in 5 Seconds..
Finite Automata PowerPoint Presentation
Download Presentation
Finite Automata

Finite Automata

444 Views Download Presentation
Download Presentation

Finite Automata

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Finite Automata

  2. Finite Automaton Input String Output “Accept” or “Reject” Finite Automaton

  3. Transition Graph initial state accepting state transition state

  4. Initial Configuration Input String

  5. Reading the Input

  6. Input finished accept

  7. Rejection

  8. Input finished reject

  9. Another Rejection

  10. reject

  11. Another Example

  12. Input finished accept

  13. Rejection Example

  14. Input finished reject

  15. Languages Accepted by FAs • FA • Definition: • The language contains • all input strings accepted by • = { strings that bring • to an accepting state}

  16. Example accept

  17. Example accept accept accept

  18. Example trap state accept

  19. Formal Definition • Finite Automaton (FA) : set of states : input alphabet : transition function : initial state : set of accepting states

  20. Input Alphabet

  21. Set of States

  22. Initial State

  23. Set of Accepting States

  24. Transition Function

  25. Transition Function

  26. Extended Transition Function

  27. Observation: if there is a walk from to with label then

  28. Example: There is a walk from to with label

  29. Recursive Definition

  30. Language Accepted by FAs • For a FA • Language accepted by :

  31. Observation • Language rejected by :