Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
1Activity

Table Of Contents

Computability
1.1 Strings, Properties, Programs
1.2 A Proof By Contradiction
1.3 A Proof of Undecidability
1.4 Diagonalization
1.5 Transformations
1.6 The Undecidability of All I/0-Properties
1.7. THE UNSOLVABILITY OF THE HALTING PROBLEM 25
1.7 The Unsolvability of the Halting Problem
1.8 G¨odel’s Incompleteness Theorem
Finite-State Machines
2.1 State Transition Diagrams
2.2 The Myhill-Nerode Theorem
2.3 Programs That Process Finite-State Machines
2.4 The Pumping Lemma for Regular Languages
Context-Free Languages
3.1 Context-Free Grammars
3.2 Parsing
3.3 The Pumping Lemma for Context-Free Gram-
3.4 A Characterization of Context-Free Languages
4.1 The State of Knowledge Before NP-Completeness
4.2 NP
4.3. THE NP-COMPLETENESS OF SATISFIABILITY 95
4.3 The NP-completeness of Satisfiability
4.4 More “NP-Complete” Problems
4.5 The “Holy Grail”: P = NP?
Bibliography
0 of .
Results for:
No results containing your search query
P. 1
Automata

Automata

Ratings: (0)|Views: 77 |Likes:
Published by Nitin Handa

More info:

Published by: Nitin Handa on Feb 12, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/17/2012

pdf

text

original

You're Reading a Free Preview
Pages 4 to 88 are not shown in this preview.
You're Reading a Free Preview
Pages 90 to 114 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->