Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Theory of Computation Lecture 9: Non-context-free Languages
 

Summary: Theory of Computation
Lecture 9: Non-context-free Languages
Max Alekseyev
University of South Carolina
February 9, 2012
Pumping Lemma
Lemma
If A is a regular language, then there exists an integer p (called the
pumping length) such that for any string s A with |s| p, the
string s can be divides into three pieces: s = xyz, satisfying the
following conditions:
1. for each i 0, xyi z A;
2. |y| > 0; and
3. |xy| p.
Pumping Lemma
Lemma
If A is a regular language, then there exists an integer p (called the
pumping length) such that for any string s A with |s| p, the
string s can be divides into three pieces: s = xyz, satisfying the
following conditions:

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences