Theoretical Computer Science

₹320.00
1679
13 Items

Specific References

According to New Revised Syllabus w.e.f. 2015-16 PUNE, Maharashtra (INDIA)

Theoretical Computer Science

TY Computer Science

Author : Anajli Sardesai

Book ID : 1679

Price: 320/-

Low Price Edition: 2nd 2017

ISBN : 978-93-5016-374-0

Quantity
In Stock

Contents

1. Preliminaries

1. Basic Concept of Language Theory 

2. Regular Expression (RE)

3. Regular Expression Identities

4. Solved Example

2. Finite Automata

1. Introduction

2. Finite Automata

3. Non-deterministic Finite Automata

4. Equivalence of Deterministic and Non-deterministic FA

5. Finite Automata with-transitions

7. Finite Automata with Output

8. Minimization of DFA

3.  Regular Languages

1. Regular Language

2. Conversion of RE to FA (Equivalence of Finite Automata and Regular Expression)

3. Pumping Lemma for Regular Languages and Applications

4. Closure Properties of Regular Languages

4. Context Free Grammar and Languages

1. Fundamental Concepts of Grammar

2. Derivation and Reduction

3. Chomsky Hierarchy

4. Context Free Grammar

5. Ambiguous Grammar

6. Simplification of CFG

7. Normal Forms

8. Regular Grammar

9. Closure Properties of CFL’S

5.   Pushdown Automata

1. Introduction

2. Definition of PDA and Examples

3. The Languages of PDA (Construction of PDA using empty stack and final state method)

4. DPDA and NFDA

5. Equivalence of PDA and CFG

6.  Turing Machine

1. Introduction

2. Turing Machine Model and Definition of TM

3. Definition of Turing Machine

4. Design of a Turing Machine

5. Problems on Language Recognizers

6. Language Accepted by TM

7. Variations of Turing Machines/Types of TM

8. Introduction to LBA & CSG

9. Types of Turing Machines  

10.Recursive Languages

11.Turing Machine Limitations (Unsolvability)

12. Decision Problems, Undecidable Problem, Halting Problem of TM