Understanding Finite Automata: Acceptance and Transitions

1. CSE322Finite Automata Lecture #2

2. Topics • Acceptability of a String by a Finite Automaton • Transition Graph and Properties of Transition Functions

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

4. Transition Graph initial state accepting state transition state

5. Initial Configuration Input String

6. Reading the Input

10. Input finished accept

11. Rejection

15. Input finished reject

16. Another Rejection

17. reject

18. Another Example

22. Input finished accept

23. Rejection Example

27. Input finished reject

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

29. accept

30. Example accept accept accept

31. Example trap state accept

32. Transition Function

36. Transition Function

37. Extended Transition Function

41. Recursive Definition