© M. Winter COSC/MATH 4P61 - Theory of Computation 3.13.1 Pumping Lemma as a game 1.Player 1 picks the language L to be proven nonregular. 2.Player 2 picks.

Slides:

Advertisements

Similar presentations

CS2303-THEORY OF COMPUTATION Closure Properties of Regular Languages

Advertisements

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineering CS 5349 – 001 CS 4384 – 001 Automata Theory

Properties of Regular Languages

Lecture 8 From NFA to Regular Language. Induction on k= # of states other than initial and final states K=0 a a* b a c d c*a(d+bc*a)*

1 Midterm I review Reading: Chapters Test Details In class, Wednesday, Feb. 25, :10pm-4pm Comprehensive Closed book, closed notes.

CS 3240: Languages and Computation Properties of Context-Free Languages.

Courtesy Costas Busch - RPI1 More Applications of the Pumping Lemma.

Foundations of (Theoretical) Computer Science Chapter 1 Lecture Notes (more on Section 1.4) David Martin This work is licensed under.

1 More Properties of Regular Languages. 2 We have proven Regular languages are closed under: Union Concatenation Star operation Reverse.

CS5371 Theory of Computation Lecture 5: Automata Theory III (Non-regular Language, Pumping Lemma, Regular Expression)

Lecture 7 Sept 22, 2011 Goals: closure properties regular expressions.

1 NFAs accept the Regular Languages. 2 Equivalence of Machines Definition: Machine is equivalent to machine if.

Fall 2006Costas Busch - RPI1 Properties of Regular Languages.

1 More Applications of the Pumping Lemma. 2 The Pumping Lemma: Given a infinite regular language there exists an integer for any string with length we.

Courtesy Costas Busch - RPI1 Non-regular languages.

Fall 2006Costas Busch - RPI1 More Applications of the Pumping Lemma.

Foundations of (Theoretical) Computer Science Chapter 2 Lecture Notes (Section 2.3: Non-Context-Free Languages) David Martin With.

Prof. Busch - LSU1 More Applications of the Pumping Lemma.

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY

NFA Closure Properties Sipser pages pages NFAs also have closure properties We have given constructions for showing that DFAs are closed under.

Properties of Regular Languages

1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 5 School of Innovation, Design and Engineering Mälardalen University 2012.

1 Let L= { w= u v : u  {a, b}*, v  {c, d}* and |u|= |v|} 1.Design a context-free grammar that generates L. 2.Use your grammar and the construction from.

1 Properties of Context-Free Languages Is a certain language context-free? Is the family of CFLs closed under a certain operation?

CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Closure.

Cs3102: Theory of Computation Class 6: Pushdown Automata Spring 2010 University of Virginia David Evans TexPoint fonts used in EMF. Read the TexPoint manual.

1 Problem of the Day: Factor (ab) k as xyz in all ways such that y ≠ ε.

1 Module 31 Closure Properties for CFL’s –Kleene Closure –Union –Concatenation CFL’s versus regular languages –regular languages subset of CFL.

Chapter 4 Pumping Lemma Properties of Regular Languages Decidable questions on Regular Languages.

Cs3102: Theory of Computation Class 8: Non-Context-Free Languages Spring 2010 University of Virginia David Evans.

CS 3240 – Chapter 4.  Closure Properties  Algorithms for Elementary Questions:  Is a given word, w, in L?  Is L empty, finite or infinite?  Are L.

Class Discussion Can you draw a DFA that accepts the language {a k b k | k = 0,1,2,…} over the alphabet  ={a,b}?

© M. Winter COSC/MATH 4P61 - Theory of Computation CFL are closed under Substitution Union Concatenation Closure (*) Homomorphism Reversal Intersection.

CS355 - Theory of Computation Regular Expressions.

1 Closure Properties of Regular Languages L 1 and L 2 are regular. How about L 1  L 2, L 1  L 2, L 1 L 2, L 1, L 1 * ?

CS 203: Introduction to Formal Languages and Automata

Pumping Lemma for CFLs. Theorem 7.17: Let G be a CFG in CNF and w a string in L(G). Suppose we have a parse tree for w. If the length of the longest path.

1 Closure Properties of Regular Languages Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism.

1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 9 Mälardalen University 2006.

CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.

TODAY WE ARE GOING TO PLAY….. “NAME THAT PROPERTY!”

Nonregular Languages How do you prove a language to be regular? How do you prove a language to be nonregular? A Pumping Lemma.

CSE 105 Theory of Computation Alexander Tsiatas Spring 2012 Theory of Computation Lecture Slides by Alexander Tsiatas is licensed under a Creative Commons.

1 Closure E.g., we understand number systems partly by understanding closure properties: Naturals are closed under +, , but not -, . Integers are closed.

CSE 105 Theory of Computation Alexander Tsiatas Spring 2012 Theory of Computation Lecture Slides by Alexander Tsiatas is licensed under a Creative Commons.

Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory III Properties of Regular Languages 1.Closure 2.Union 3.Concatenation 4.Complement(Negation)

MA/CSSE 474 Theory of Computation How many regular/non-regular languages are there? Closure properties of Regular Languages (if there is time) Pumping.

1 Use the pumping theorem for context-free languages to prove that L= { a n b a n b a p : n, p ≥ 0, p ≥ n } is not context-free. Hint: For the pumping.

Closure Properties of Regular Languages

Properties of Regular Languages

PROPERTIES OF REGULAR LANGUAGES

FORMAL LANGUAGES AND AUTOMATA THEORY

7. Properties of Context-Free Languages

Formal Language & Automata Theory

PDAs Accept Context-Free Languages

CSE322 PROPERTIES OF REGULAR LANGUAGES

Properties of Regular Languages

CSE322 CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT TO REGULAR EXPRESSION Lecture #9.

4. Properties of Regular Languages

7. Properties of Context-Free Languages

Today we are going to play…..

Deterministic PDAs - DPDAs

Closure Properties of Regular Languages

Properties of Context-Free languages

CS 461 – Sept. 16 Review Pumping lemma Applications of FA:

Closure Properties of Regular Languages

Chapter 1 Regular Language - 02

NFAs accept the Regular Languages

Chapter 8. PROPERTIES OF CONTEXT-FREE LANGUAGES Exercises

Presentation transcript:

© M. Winter COSC/MATH 4P61 - Theory of Computation Pumping Lemma as a game 1.Player 1 picks the language L to be proven nonregular. 2.Player 2 picks n secretly. 3.Player 1 picks w (may depend on n). 4.Player 2 divides w into x, y, and z so that y≠ε and |xy|≤n. 5.Player 1 wins by picking k (may depend on n, |x|, |y|, and |z|) so that xy k z is not in L.

© M. Winter COSC/MATH 4P61 - Theory of Computation The union of two regular languages is regular. 2.The intersection of two regular languages is regular. 3.The complement of a regular language is regular. 4.The difference of two regular languages is regular. 5.The reversal of a regular language is regular. 6.The closure (by *) of a regular language is regular. 7.The concatenation of two regular languages is regular. 8.A homomorphic image of a regular language is regular. 9.An inverse homomorphic image of a regular language is regular. Closure Properties of Regular Languages

© M. Winter COSC/MATH 4P61 - Theory of Computation Example I

© M. Winter COSC/MATH 4P61 - Theory of Computation Example II

© M. Winter COSC/MATH 4P61 - Theory of Computation Example I (continued)