ATFL Lecture 3

ATFL- Lecture #3
Finite Automata
A. Senthil - Professor/CSE 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
l
a, b
q5
a a, b
b a b
Output:
“reject” A. Senthil - Professor/CSE 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, S, d , q0 , F )
Q : set of states
S : input alphabet
d : transition function
q0 : initial state q0 Î Q
F : set of final states F Í Q

Input Alphabet S
S = {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 d
d :Q´S ® Q
a, b
q5
b a a, b
a b
d (q0 , a ) = q1
a, b
q5
b a a, b
a b
d (q0 , b ) = q5
a, b
q5
b a a, b
a b
d (q2 , b ) = q3
a, b
q5
b a a, b
a b
Transition Function d
d 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
d *or dˆ
d * : Q ´ S* ® Q
a, b
q5
b a a, b
a b
d * (q0 , ab ) = q2
a, b
q5
b a a, b
a b
d * (q0 , abba ) = q4
a, b
q5
b a a, b
a b
d * (q0 , abbbaa ) = q5
a, b
q5
b a a, b
a b
Observation: There is a walk from q to q¢
with label w
d * ( q , w ) = q¢
q w q¢
w = s 1s 2 !s k
s1 s2 sk
q q¢
Example: There is a walk from q0 to q5
with label abbbaa
d * (q0 , abbbaa ) = q5
a, b
q5
b a a, b
a b
Inductive Definition
Basis d * (q , l ) = q
Induction d * (q, ws ) = d (d * (q, w),s )
q w q1 s q¢
d * ( q , ws ) = q¢
d * (q, ws ) = d (q1,s )
d (q1,s ) = q¢
d * (q, ws ) = d (d * (q, w),s )
d * (q, w) = q1
d * (q0 , ab ) =
d (d * (q0 , a ), b ) =
d (d (d * (q0 , l ), a ), b ) =
d (d (q0 , a ), b ) =
d (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 ) = {l , ab, abba} M
a, b
q5
b a a a, b
b
accept accept accept
Formally
For a DFA M = (Q, S, d , q0 , F )
Language accepted by M :
L(M ) = {w Î S* : d * (q0 , w) Î F }
q0 w q¢ q¢ Î F
Observation
Language rejected by M :
L(M ) = {w Î S* : d * (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
l 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} {l , 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:
Example: n n
L= {a b : n ³ 0}
There is no DFA that accepts such a language
(we will prove this later in the class)

ATFL Lecture 3

Uploaded by

Document Information

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

ATFL Lecture 3

Uploaded by

Copyright:

Available Formats

ATFL- Lecture #3

F : set of final states F Í Q

L(M ) = { strings that drive M to a final state}

accept trap state

A language L is regular if there is

All regular languages form a language family

{abba} {l , 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)

You might also like