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

Info iconThis preview shows pages 1–14. Sign up to view the full content.

View Full Document Right Arrow Icon
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 15-453
Background image of page 1

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

View Full DocumentRight Arrow Icon
FIRST HOMEWORK IS DUE Thursday, January 22
Background image of page 2
NON-DETERMINISM THURSDAY JAN 18
Background image of page 3

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

View Full DocumentRight Arrow Icon
NON-DETERMINISM AND THE PUMPING LEMMA THURSDAY JAN 18
Background image of page 4
Q = {q 0 , q 1 , q 2 , q 3 } Σ = {0,1} δ : Q × Σ → Q transition function * q 0 Q is start state F = {q 1 , q 2 } Q accept states M = (Q, Σ, δ , q 0 , F) where δ 0 1 q 0 q 0 q 1 q 1 q 2 q 2 q 2 q 3 q 2 q 3 q 0 q 2 * q 2 0 0,1 0 0 1 1 1 q 0 q 1 q 3 M
Background image of page 5

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

View Full DocumentRight Arrow Icon
Q is the set of states (finite) Σ is the alphabet (finite) δ : Q × Σ → Q is the transition function q 0 Q is the start state F Q is the set of accept states A ^ finite automaton ^ is a 5-tuple M = (Q, Σ, δ , q 0 , F) deterministic DFA M accepts a string w if the process ends in a double circle
Background image of page 6
Q is the set of states (finite) Σ is the alphabet (finite) δ : Q × Σ → Q is the transition function q 0 Q is the start state F Q is the set of accept states A ^ finite automaton ^ is a 5-tuple M = (Q, Σ, δ , q 0 , F) deterministic DFA Let w 1 , . .. , w n Σ and w = w 1 ... w n Σ* Then M accepts w if there are r 0 , r 1 , . .., r n Q , s.t . 1. r 0 = q 0 2. δ ( r i , w i+1 ) = r i+1 , for i = 0, . .., n-1, and 3. r n F
Background image of page 7

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

View Full DocumentRight Arrow Icon
Q is the set of states (finite) Σ is the alphabet (finite) δ : Q × Σ → Q is the transition function q 0 Q is the start state F Q is the set of accept states A ^ finite automaton ^ is a 5-tuple M = (Q, Σ, δ , q 0 , F) deterministic DFA A language L is regular if it is recognized by a deterministic finite automaton, i.e. if there is a DFA M such that L = L ( M ). L( M ) = set of all strings machine M accepts
Background image of page 8
UNION THEOREM The union of two regular languages is also a regular language Intersection THEOREM The intersection of two regular languages is also a regular language
Background image of page 9

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

View Full DocumentRight Arrow Icon
Complement THEOREM The complement of a regular languages is also a regular language In other words, if L is regular than so is ¬ L, where ¬ L= { w Σ* | w L } Proof ?
Background image of page 10
THE REGULAR OPERATIONS Union: A B = { w | w A or w B } Intersection: A B = { w | w A and w B } Negation: ¬ A = { w Σ* | w A } Reverse: A R = { w 1 …w k | w k …w 1 A } Concatenation: A B = { vw | v A and w B } Star: A* = { w 1 …w k | k ≥ 0 and each w i A }
Background image of page 11

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

View Full DocumentRight Arrow Icon
Reverse THEOREM The reverse of a regular languages is also a regular language
Background image of page 12
REVERSE CLOSURE Regular languages are closed under reverse Assume L is a regular language and M recognizes L We build M R that accepts L R If M accepts w then w describes a directed path in M from start to an accept state Define M R as M with the arrows reversed
Background image of page 13

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

View Full DocumentRight Arrow Icon
Image of page 14
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 55

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

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online