Lecture4x

# Lecture4x - 15-453 FORMAL LANGUAGES, AUTOMATA AND...

This preview shows pages 1–16. Sign up to view the full content.

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 15-453

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
MINIMIZING DFAs THURSDAY Jan 24
IS THIS MINIMAL? 1 1 1 1 0 0 0 0 NO

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
IS THIS MINIMAL? 0 1 0 1
THEOREM For every regular language L, there exists a UNIQUE (up to re-labeling of the states) minimal DFA M such that L = L(M)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
NOT TRUE FOR NFAs 0 0 0 0
EXTENDING δ Given DFA M = (Q, Σ, δ , q 0 , F) extend δ to δ : Q × Σ* → Q as follows: δ (q, ε) = δ (q, σ ) = δ (q, σ 1 σ k+1 ) = δ ( δ (q, σ 1 σ k ) , σ k+1 ) ^ ^ ^ ^ ^ String w Σ* distinguishes states q 1 and q 2 iff δ (q 1 , w) F δ (q 2 , w) F ^ ^ q δ (q, σ ) ^ Note: δ (q 0 , w) F M accepts w

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
EXTENDING δ Given DFA M = (Q, Σ, δ , q 0 , F) extend δ to δ : Q × Σ* → Q as follows: δ (q, ε) = δ (q, σ ) = δ (q, σ 1 σ k+1 ) = δ ( δ (q, σ 1 σ k ) , σ k+1 ) ^ ^ ^ ^ ^ String w Σ* distinguishes states q 1 and q 2 iff q δ (q, σ ) ^ Note: δ (q 0 , w) F M accepts w exactly ONE of δ (q 1 , w), δ (q 2 , w) is a final state ^ ^
Fix M = (Q, Σ, δ , q 0 , F) and let p, q Q DEFINITION: p is distinguishable from q iff there is a w Σ* that distinguishes p and q p is indistinguishable from q iff p is not distinguishable from q iff for all w Σ*, δ (p, w) F δ (q, w) F ^ ^

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
0 0,1 0 0 1 1 1 q 0 q 1 q 2 q 3 ε distinguishes accept from non-accept states
Fix M = (Q, Σ, δ , q 0 , F) and let p, q, r Q Define relation ~ : p ~ q iff p is indistinguishable from q p ~ q iff p is distinguishable from q / Proposition: ~ is an equivalence relation p ~ p (reflexive) p ~ q q ~ p (symmetric) p ~ q and q ~ r p ~ r (transitive) Proof (of transitivity): for all w, we have: δ (p, w) F δ (q, w) F δ (r, w) F ^ ^ ^

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Fix M = (Q, Σ, δ , q 0 , F) and let p, q, r Q Proposition: ~ is an equivalence relation so ~ partitions the set of states of M into disjoint equivalence classes q 0 Q q [q] = { p | p ~ q }
p ~ q iff p is indistinguishable from q p ~ q iff p is distinguishable from q / Proposition: ~ is an equivalence relation p ~ p (reflexive) p ~ q q ~ p (symmetric) p ~ q and q ~ r p ~ r (transitive) so ~ partitions the set of states of M into disjoint equivalence classes q 0 Q q [q] = { p | p ~ q }

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1 1 1 1 0 0 0 0
Algorithm MINIMIZE

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/29/2012 for the course CS 15-453 taught by Professor Edmundm.clarke during the Spring '09 term at Carnegie Mellon.

### Page1 / 43

Lecture4x - 15-453 FORMAL LANGUAGES, AUTOMATA AND...

This preview shows document pages 1 - 16. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online