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

Table Of Contents

Introduction to Theoretical Computer Science
Recursive Definition
Mathematical Induction
Introduction to Language
Definitions on Language
Problem Solving as Language Recognition
(a.k.a Structural Induction)
Definitions of Regular Language and Regular Expression
Exercise Questions on Regular Language and Regular Expression
Properties of Regular Language
Introduction to Finite Automata
Definition of Deterministic Finite Automata
of DFA and its Properties
Language Accepted by NFA
Definition of Nondeterministic Finite Automata with - Transitions
Language Accepted by NFA-
Equivalence of DFAs, NFAs and NFA-s
Proof of Equivalence of NFA- and NFA
Equivalence of NFA and DFA
Kleene's Theorem --- Part 1
Kleene's Theorem -- Part 2
Comlement and Intersection of Regular Language
Regular Grammar
Minimization of DFA
Application of Finite Automata
Simulation of Finite Automata
Non-Regular Languages
Context-Free Grammar
Turing Machines
Turing Machine that accepts aba*
Combination of Turing Machines
Types of Turing Machines
Unsolvable Problems
More Unsolvable Problems
Time Complexity
0 of .
Results for:
No results containing your search query
P. 1


Ratings: (0)|Views: 1,820 |Likes:
Published by Manjeet Kumar Singh

More info:

Published by: Manjeet Kumar Singh on Mar 04, 2011
Copyright:Attribution Non-commercial


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





You're Reading a Free Preview
Pages 4 to 122 are not shown in this preview.
You're Reading a Free Preview
Pages 126 to 157 are not shown in this preview.

Activity (19)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Bukurie Shabani liked this
Saya Hamka liked this
Surya Kiran liked this
swlunatic liked this
Hussin Arab liked this
Fyruz FyFive liked this

You're Reading a Free Preview

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