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 13: Undecidable Languages
 

Summary: Theory of Computation
Lecture 13: Undecidable Languages
Max Alekseyev
University of South Carolina
March 1, 2012
Decidable vs. Undecidable Languages
EQDFA = { A, B | A, B are DFAs and L(A) = L(B)}
EQCFG = { G, H | G, H are CFGs and L(G) = L(H)}
We proved that EQDFA is decidable. In contrast to EQDFA, it is
not clear how to prove that EQCFG is decidable.
Decidable vs. Undecidable Languages
EQDFA = { A, B | A, B are DFAs and L(A) = L(B)}
EQCFG = { G, H | G, H are CFGs and L(G) = L(H)}
We proved that EQDFA is decidable. In contrast to EQDFA, it is
not clear how to prove that EQCFG is decidable.
In fact, it is NOT decidable. But it is still unclear how to prove
that.
Our goal is to prove undecidability of another somewhat "simpler"
language
ATM = { M, w | M is a TM and M accepts w}

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences