CSE322 Finite Automata Lecture #2

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

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

Transition Graph initial state accepting state transition state

Initial Configuration Input String

Reading the Input

Input finished accept

Rejection

Input finished reject

Another Rejection

reject

Another Example

Input finished accept

Rejection Example

Input finished reject

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

accept

Example accept accept accept

Example trap state accept

Transition Function

Transition Function

Extended Transition Function

Recursive Definition