MELJUN CORTES Automata Theory (Automata7)
Upcoming SlideShare
Loading in...5
×
 

Like this? Share it with your network

Share

MELJUN CORTES Automata Theory (Automata7)

on

  • 121 views

MELJUN CORTES Automata Theory (Automata7)

MELJUN CORTES Automata Theory (Automata7)

Statistics

Views

Total Views
121
Views on SlideShare
121
Embed Views
0

Actions

Likes
0
Downloads
2
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

MELJUN CORTES Automata Theory (Automata7) Presentation Transcript

  • 1. MELJUN P. CORTES, MBA,MPA,BSCS,ACS CSC 3130: Automata theory and formal languages More on DFA minimization and DFA equivalence MELJUN CORTES
  • 2. Example • Construct a DFA over alphabet {0, 1} that accepts those strings that end in 111 0 0 q0 1 qε 1 0 q1 1 q00 1 q01 … q10 q11 1 … 1 1 q001 … 0 q000 q101 … 0 q111 • This is big, isn’t there a smaller DFA for this? 1
  • 3. Smaller DFA • Yes, we can do it with 4 states: 0 q0 1 0 1 q1 0 0 q2 1 q3 1
  • 4. No smaller DFA! • Last time we saw that There is no DFA with 3 states for L • In fact, it is also true that This is the unique 4-state DFA for L 0 q0 1 0 1 q1 0 0 q2 1 q3 1
  • 5. Theorem The DFA M found by the minimization algorithm is the unique minimal DFA for L • Proof outline – Suppose there are two minimal DFAs M, M’ for L q0 M q0’ M’ – In both M and M’, every pair of states is distinguishable
  • 6. Proof outline for uniqueness • If M and M’ are not the same, there must be states q1, q2 of M and q’ of M’ like this: u q1 M q0 M’ q0’ v q2 – For some strings u and v q’ u, v
  • 7. Proof outline for uniqueness • Since q1 and q2 are distinguishable, there is a string w such that u v q1 q2 w M’ w • But in M’ this cannot happen! M’’ q’ u, v w ?
  • 8. Testing equivalence of DFAs • Two DFAs are called equivalent if they accept the same language 0 0 q0 0 1 qε 0 1 q1 1 q01 1 q10 1 0 0 0 q11 1 0 qΑ q00 1 0 qΒ 0 1 qC 1 1
  • 9. Testing equivalence of DFAs • How can we tell if M and M’ are equivalent? • Algorithm for testing DFA equivalence: Run DFA minimization algorithm on M Run DFA minimization algorithm on M’ Check that M and M’ are the same
  • 10. Example • Do the following two NFAs 0 0,1 q0 0,1 1 q1 0 q0 1 1 accept the same language? q1 0
  • 11. Answer • We cannot run minimization procedure on NFAs • But we can convert both NFAs to DFA and test equivalence regular expression NFA DFA