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 6: Nonregular Languages
 

Summary: Theory of Computation
Lecture 6: Nonregular Languages
Max Alekseyev
University of South Carolina
January 27, 2012
Lecture Outline
Nonregular Languages
Nonregular Languages
Pumping Lemma
Examples of nonregular languages
Examples
For a fixed integer n 0, define a language Ln = {0n1n}.
Q: Is Ln regular?
Examples
For a fixed integer n 0, define a language Ln = {0n1n}.
Q: Is Ln regular?
Q: Are the following languages regular?
L0 L1, L0 L1 L2, L0 L1 L2 L3
Examples
For a fixed integer n 0, define a language Ln = {0n1n}.

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences