The document describes a finite automaton and its components. A finite automaton takes an input string and outputs whether to accept or reject it based on its transition between states. The components include a set of states, an input alphabet, transition functions, an initial state, and a set of final/accepting states. It provides examples of finite automata processing different input strings and their outputs.
The document describes a finite automaton and its components. A finite automaton takes an input string and outputs whether to accept or reject it based on its transition between states. The components include a set of states, an input alphabet, transition functions, an initial state, and a set of final/accepting states. It provides examples of finite automata processing different input strings and their outputs.
The document describes a finite automaton and its components. A finite automaton takes an input string and outputs whether to accept or reject it based on its transition between states. The components include a set of states, an input alphabet, transition functions, an initial state, and a set of final/accepting states. It provides examples of finite automata processing different input strings and their outputs.
The document describes a finite automaton and its components. A finite automaton takes an input string and outputs whether to accept or reject it based on its transition between states. The components include a set of states, an input alphabet, transition functions, an initial state, and a set of final/accepting states. It provides examples of finite automata processing different input strings and their outputs.
Download as PPT, PDF, TXT or read online from Scribd
Download as ppt, pdf, or txt
You are on page 1/ 57
Finite Automata
Costas Busch - RPI 1
Finite Automaton
Input String
Output Finite String Automaton
Costas Busch - RPI 2
Finite Accepter
Input String Output “Accept” Finite or Automaton “Reject”
Costas Busch - RPI 3
Transition Graph Abba -Finite Accepter a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
initial final state state transition state “accept” Costas Busch - RPI 4 Initial Configuration Input String a b b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 5
Reading the Input
a b b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 6
a b b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 7
a b b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 8
a b b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 9
Input finished
a b b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Output: “accept” Costas Busch - RPI 10 Rejection
a b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 11
a b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 12
a b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 13
a b a
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 14
Input finished
a b a
a, b Output: q5 “reject” a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 15
Another Rejection
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 16
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Output: “reject” Costas Busch - RPI 17 Another Example
a a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 18
a a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 19
a a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 20
a a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 21
Input finished
a a b
a a,b Output: “accept”
q0 b q1 a, b q2
Costas Busch - RPI 22
Rejection
b a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 23
b a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 24
b a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 25
b a b
a a,b
q0 b q1 a, b q2
Costas Busch - RPI 26
Input finished
b a b
a a,b
q0 b q1 a, b q2
Output: “reject”
Costas Busch - RPI 27
Formalities Deterministic Finite Accepter (DFA)
M Q, , , q0 , F Q : set of states : input alphabet : transition function q0 : initial state F : set of final states Costas Busch - RPI 28 Input Alphabet
a, b
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 29
Set of States Q Q q0 , q1, q2 , q3 , q4 , q5
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 30
Initial State q0
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 31
Set of Final States F
F q4
a, b
q5 a a, b b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 32
Transition Function
:Q Q
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 33
q0 , a q1
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 34
q0 , b q5
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 35
q2 , b q3
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 36
Transition Function a b q0 q1 q5 q1 q5 q2 q2 q5 q3 q3 q4 q5 a, b q4 q5 q5 q5 q5 q5 q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 37
Extended Transition Function *
* : Q * Q
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 38
* q0 , ab q2
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 39
* q0 , abba q4
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 40
* q0 , abbbaa q5
a, b
q5 b a a, b a b q0 a q1 b q2 b q3 a q4
Costas Busch - RPI 41
Observation: There is a walk from q to q with label w
* q , w q
q w q
w 1 2 k 1 2 k q q
Costas Busch - RPI 42
Example: There is a walk from q0 to q5 with label abbbaa
