DFA

Deterministic
Finite Automata
And Regular Languages
Fall 2006 Costas Busch - RPI 1

Deterministic Finite Automaton (DFA)
Input Tape
String
Output
“Accept”
Finite
or
Automaton
“Reject”

Transition Graph
a, b
q5
a a, b
b a b
q0 a q1 b q2 b q3 a q4
initial accepting
state state
transition
state
Alphabet   {a , b }
a, b
q5
a a, b
b a b
For every state, there is a transition

for every symbol in the alphabet

head Initial Configuration
Input Tape
a b b a
Input String
a, b
q5
a a, b
b a b
Initial state
Scanning 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

Input finished
a b b a
a, b
q5
a a, b
b a b
accept
A Rejection Case
a b a
Input String
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
reject
q5
a a, b
b a b

Another Rejection Case
Tape is empty
( )
Input Finished
a, b
q5
a a, b
b a b
reject
Language Accepted: L  abba 
a, b
q5
a a, b
b a b

To accept a string:
all the input string is scanned
and the last state is accepting
To reject a string:
all the input string is scanned
and the last state is non-accepting

Another Example
L  , ab, abba

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

state state state
Empty Tape
( )
Input Finished a, b
q5
b a a a, b
b
accept
Another Example
a a, b
q0 b q1 a, b q2
Accept trap state

state
a a b
Input String
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
accept
q0 b q1 a, b q2

A rejection case
b a b
Input String
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
reject

Language Accepted: L  {a b : n  0}
n
a a, b
q0 b q1 a, b q2

Another Example
Alphabet:   {1}
1
q0 q1
1
Language Accepted:
EVEN  {x : x   and x is even}

*
 {, 11, 1111, 111111, }

Formal Definition
Deterministic Finite Automaton (DFA)
M  Q, ,  , q0 , F 
Q : set of states
 : input alphabet  
 : transition function
q0 : initial state
F : set of accepting states

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

Input Alphabet 
  :the input alphabet never contains 
Example
  a, b a, b
q5
b a a, b
a b

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

Set of Accepting States F  Q
Example
F  q4  a, b
q5
a a, b
b a b

Transition Function  :Q  Q
 (q , x )  q 
x
q q
Describes the result of a transition

from state q with symbol x

Example:
 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 Table for 
symbols
 a b
q0 q1 q5
q1 q5 q2
states
q2 q5 q3
a, b
q3 q4 q5
q4 q5 q5
q5
q5 q5 q5 a, b
b a a b
Extended Transition Function
 :Q   Q
* *
 (q ,w )  q 
*
Describes the resulting state

after scanning string w from state q

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

 q1 , bba   q4
*
a, b
q5
b a a, b
a b

Special case:
for any state q
 q ,    q
*

In general:  q ,w   q 
*
implies that there is a walk of transitions
w   1 2  k
1 2 k
q q
states may be repeated
q w q
Language Accepted by DFA
Language of DFA M:
it is denoted as L M  and contains
all the strings accepted by M
We say that a language L

is accepted (or recognized)
by DFA M if L M  L  
For a DFA M  Q, ,  , q0 , F 
Language accepted by M:

L M   w   :  q0 ,w   F
* *

q0 w q q  F

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

More DFA Examples
  {a , b }
a, b
a, b
q0 q0
L(M )  { } L (M )   *
Empty language All strings

  {a , b }
a, b
q0 a, b q0
L(M )  { }
Language of the empty string
  {a , b }
LM = { all strings with prefix ab }
a, b
q0 a q1 b q2
b a accept
q3 a, b

LM  = { all binary strings containing
substring 001 }
0,1
1 0
1
 0 0 00 1 001
0

LM  = { all binary strings without
substring 001 }
1 0 0,1
1
 0 1
0 00 001
0

L(M )  awa : w  a , b 
*
 a
b
b
q0 a q2 q3
b a
q4
a, b
Regular Languages
Definition:
A language L is regular if there is
a DFA M that accepts it ( L(M )  L )
The languages accepted by all DFAs

form the family of regular languages

Example regular languages:
abba  , ab, abba

{a b : n  0} awa : w  a , b  
n *
{ all strings in {a,b}* with prefix ab }

{ all binary strings without substring 001}
{x : x  {1} and x is even}
*
{ } { } {a , b } *
There exist automata that accept these

languages (see previous slides).
There exist languages which are not Regular:
L {a b : n  0}
n n
ADDITION  {x  y  z : x  1 , y  1 , z  1 ,
n m k
nm k}
There is no DFA that accepts these languages
(we will prove this in a later class)


DFA

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

DFA

Caricato da

Copyright:

Formati disponibili

Deterministic

And Regular Languages

Fall 2006 Costas Busch - RPI 1

Fall 2006 Costas Busch - RPI 2

For every state, there is a transition

Fall 2006 Costas Busch - RPI 4

Fall 2006 Costas Busch - RPI 6

Fall 2006 Costas Busch - RPI 7

Fall 2006 Costas Busch - RPI 8

Fall 2006 Costas Busch - RPI 10

Fall 2006 Costas Busch - RPI 11

Fall 2006 Costas Busch - RPI 12

Fall 2006 Costas Busch - RPI 13

Fall 2006 Costas Busch - RPI 15

Fall 2006 Costas Busch - RPI 16

L  , ab, abba

Accept Accept Accept

Accept trap state

Fall 2006 Costas Busch - RPI 20

Fall 2006 Costas Busch - RPI 21

Fall 2006 Costas Busch - RPI 22

Fall 2006 Costas Busch - RPI 23

Fall 2006 Costas Busch - RPI 24

Fall 2006 Costas Busch - RPI 25

Fall 2006 Costas Busch - RPI 26

Fall 2006 Costas Busch - RPI 27

Fall 2006 Costas Busch - RPI 28

EVEN  {x : x   and x is even}

 {, 11, 1111, 111111, }

F : set of accepting states

Fall 2006 Costas Busch - RPI 31

  :the input alphabet never contains 

Fall 2006 Costas Busch - RPI 32

Fall 2006 Costas Busch - RPI 33

Fall 2006 Costas Busch - RPI 34

Describes the result of a transition

Fall 2006 Costas Busch - RPI 35

Fall 2006 Costas Busch - RPI 36

Fall 2006 Costas Busch - RPI 37

Fall 2006 Costas Busch - RPI 38

Describes the resulting state

Fall 2006 Costas Busch - RPI 40

Fall 2006 Costas Busch - RPI 42

Fall 2006 Costas Busch - RPI 43

for any state q

Fall 2006 Costas Busch - RPI 44

implies that there is a walk of transitions

We say that a language L

Fall 2006 Costas Busch - RPI 47

Fall 2006 Costas Busch - RPI 48

Empty language All strings

Fall 2006 Costas Busch - RPI 51

Fall 2006 Costas Busch - RPI 52

The languages accepted by all DFAs

Fall 2006 Costas Busch - RPI 55

abba  , ab, abba

{ all strings in {a,b}* with prefix ab }

There exist automata that accept these

There is no DFA that accepts these languages

(we will prove this in a later class)

Potrebbero piacerti anche