Download Presentation
## Finite Automata

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -

**Finite Automaton**Input String Output “Accept” or “Reject” Finite Automaton**Transition Graph**initial state accepting state transition state**Initial Configuration**Input String**Input finished**accept**Input finished**reject**Input finished**accept**Input finished**reject**Languages Accepted by FAs**• FA • Definition: • The language contains • all input strings accepted by • = { strings that bring • to an accepting state}**Example**accept**Example**accept accept accept**Example**trap state accept**Formal Definition**• Finite Automaton (FA) : set of states : input alphabet : transition function : initial state : set of accepting states**Observation: if there is a walk from to**with label then**Example: There is a walk from to**with label**Language Accepted by FAs**• For a FA • Language accepted by :**Observation**• Language rejected by :