Class 02

Finite Automata
Courtesy Costas Busch - RPI 1

Finite Automaton
Input
String
Output
Finite String
Automaton

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

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”
Initial Configuration
Input String
a b b a
a, b
q5
a a, b
b a b

Reading the Input
a b b a
a, b
q5
a a, b
b a b

a b b a
a, b
q5
a a, b
b a b

a b b a
a, b
q5
a a, b
b a b

a b b a
a, b
q5
a a, b
b a b

Input finished
a b b a
a, b
q5
a a, b
b a b
Output: “accept”
Rejection
a b a
a, b
q5
a a, b
b a b

a b a
a, b
q5
a a, b
b a b

a b a
a, b
q5
a a, b
b a b

a b a
a, b
q5
a a, b
b a b

Input finished
a b a
a, b
Output:
q5 “reject”
a a, b
b a b

Another Rejection
a, b
q5
a a, b
b a b


a, b
q5
a a, b
b a b
Output:
“reject” Courtesy Costas Busch - RPI 17
Another Example
a a b
a a, b
q0 b q1 a, b q2

a a b
a a, b
q0 b q1 a, b q2

a a b
a a, b
q0 b q1 a, b q2

a a b
a a, b
q0 b q1 a, b q2

Input finished
a a b
a a, b
Output: “accept”
q0 b q1 a, b q2

Rejection
b a b
a a, b
q0 b q1 a, b q2

b a b
a a, b
q0 b q1 a, b q2

b a b
a a, b
q0 b q1 a, b q2

b a b
a a, b
q0 b q1 a, b q2

Input finished
b a b
a a, b
q0 b q1 a, b q2
Output: “reject”

Formalities
Deterministic Finite
Accepter (DFA)
M  Q, ,  , q0 , F 
Q : set of states
 : input alphabet
 : transition function
q0 : initial state q0  Q
F : set of final states F  Q
Input Alphabet 
  a, b
a, b
q5
b a a, b
a b

Set of States Q
Q  q0 , q1, q2 , q3 , q4 , q5 
a, b
q5
a a, b
b a b

Initial State q0
a, b
q5
a a, b
b a b

Set of Final States F
F  q4 
a, b
q5
a a, b
b a b

Transition Function 
 :Q  Q
a, b
q5
b a a, b
a b

 q0 , a   q1
a, b
q5
b a a, b
a b

 q0 , b   q5
a, b
q5
b a a, b
a b

 q2 , b   q3
a, b
q5
b a a, b
a b

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
Extended Transition Function
 *or ˆ
 * : Q  *  Q
a, b
q5
b a a, b
a b

 * q0 , ab   q2
a, b
q5
b a a, b
a b

 * q0 , abba   q4
a, b
q5
b a a, b
a b

 * q0 , abbbaa   q5
a, b
q5
b a a, b
a b

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

Example: There is a walk from q0 to q5
with label abbbaa
 * q0 , abbbaa   q5
a, b
q5
b a a, b
a b

Inductive Definition
Basis  * q,    q
Induction  * q, w    ( * (q, w), )
q w q1  q
 * q, w   q
 * q, w    (q1, )
 (q1, )  q
 * q, w    ( * (q, w), )
 * q, w  q1

 * q0 , ab  
  * (q0 , a ), b  
   * q0 ,  , a , b  
  q0 , a , b  
 q1 , b  
q2 a, b
q5
b a a, b
a b
Languages Accepted by DFAs
Take DFA M
Definition:
The language LM  contains
all input strings accepted by M
LM  = { strings that drive M to a final state}

Example
LM   abba M
a, b
q5
b a a, b
a b
accept

Another Example
LM    , ab, abba M
a, b
q5
b a a a, b
b
accept accept accept

Formally
For a DFA M  Q, ,  , q0 , F 
Language accepted by M :
LM   w  * :  * q0 , w F 
q0 w q q  F

Observation
Language rejected by M :
LM   w  * :  * q0 , w F 
q0 w q q  F

More Examples
LM   {a b : n  0}
n
a a, b
q0 b q1 a, b q2
accept trap state

LM = { all strings with prefix ab }
a, b
q0 a q1 b q2
b a accept
q3 a, b

L M  = { all strings without
substring 001 }
1 0 0,1
1
 0 1
0 00 001
0
Regular Languages
A language L is regular if there is

a DFA M such that L  LM 
All regular languages form a language family

Examples of regular languages:
abba  , ab, abba n

{a b : n  0}
{ all strings with prefix ab }
{ all strings with prefix ab }
{ all strings without substring 001 }
There exist automata that accept these

Languages (see previous slides).
Another Example
The language L  awa : w  a, b*
is regular:
a
b
L  LM  b
q0 a q2 q3
b a
q4
a, b
There exist languages which are not Regular:
n n
Example: L {a b : n  0}
There is no DFA that accepts such a language
(we will prove this later in the class)

Class 02

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Class 02

Uploaded by

Copyright:

Available Formats

Finite Automata

Courtesy Costas Busch - RPI 1

Courtesy Costas Busch - RPI 2

Courtesy Costas Busch - RPI 3

Courtesy Costas Busch - RPI 5

Courtesy Costas Busch - RPI 6

Courtesy Costas Busch - RPI 7

Courtesy Costas Busch - RPI 8

Courtesy Costas Busch - RPI 9

Courtesy Costas Busch - RPI 11

Courtesy Costas Busch - RPI 12

Courtesy Costas Busch - RPI 13

Courtesy Costas Busch - RPI 14

Courtesy Costas Busch - RPI 15

Courtesy Costas Busch - RPI 16

Courtesy Costas Busch - RPI 18

Courtesy Costas Busch - RPI 19

Courtesy Costas Busch - RPI 20

Courtesy Costas Busch - RPI 21

Courtesy Costas Busch - RPI 22

Courtesy Costas Busch - RPI 23

Courtesy Costas Busch - RPI 24

Courtesy Costas Busch - RPI 25

Courtesy Costas Busch - RPI 26

Courtesy Costas Busch - RPI 27

Courtesy Costas Busch - RPI 29

Courtesy Costas Busch - RPI 30

Courtesy Costas Busch - RPI 31

Courtesy Costas Busch - RPI 32

Courtesy Costas Busch - RPI 33

Courtesy Costas Busch - RPI 34

Courtesy Costas Busch - RPI 35

Courtesy Costas Busch - RPI 36

Courtesy Costas Busch - RPI 38

Courtesy Costas Busch - RPI 39

Courtesy Costas Busch - RPI 40

Courtesy Costas Busch - RPI 41

Courtesy Costas Busch - RPI 42

Courtesy Costas Busch - RPI 43

Courtesy Costas Busch - RPI 44

LM  = { strings that drive M to a final state}

Courtesy Costas Busch - RPI 46

Courtesy Costas Busch - RPI 47

Courtesy Costas Busch - RPI 48

Courtesy Costas Busch - RPI 49

LM   w  * :  * q0 , w F 

Courtesy Costas Busch - RPI 50

accept trap state

Courtesy Costas Busch - RPI 51

Courtesy Costas Busch - RPI 52

A language L is regular if there is

All regular languages form a language family

Courtesy Costas Busch - RPI 54

abba  , ab, abba n

There exist automata that accept these

There is no DFA that accepts such a language

(we will prove this later in the class)

Courtesy Costas Busch - RPI 57

You might also like