Welcome to Prashant Publications

Rs. 185.00 10% OFF
Availability: 10 left in stock

This textbook titled “Theory of Computer Science” for the course CS-304-MJ-T offered in Semester V of T.Y.B.Sc. (Computer Science) under the Savitribai Phule Pune University (SPPU) curriculum. This book has...

Guaranteed safe checkout:

apple paygoogle paymasterpaypalshopify payvisa

Orders ship within 5 to 10 business days.

Hoorey ! This item ships free to the US

Theory of Computer Science - CS-304-MJE-T
- +

This textbook titled “Theory of Computer Science” for the course CS-304-MJ-T offered in Semester V of T.Y.B.Sc. (Computer Science) under the Savitribai Phule Pune University (SPPU) curriculum. This book has been developed in alignment with the NEP 2026–27 syllabus and aims to provide students with a solid foundation in data structures, their implementation, and their applications in solving computational problems.
Data structures are a fundamental component of computer science. They provide systematic ways to organize, manage, and process data efficiently. This subject helps learners bridge the gap between basic programming skills and advanced problem-solving techniques required in software development.
Each chapter has been written in simple language, supported by diagrams, algorithms, and example programs in C to strengthen understanding. The book emphasizes not only theoretical concepts but also the practical implementation aspects that are crucial for developing real-world applications.

This textbook will serve as a helpful companion to students and teachers alike in their academic journey, and will encourage learners to think analytically and solve problems effectively using appropriate data structures. We welcome constructive suggestions and feedback from readers to improve future editions of this book.

Chapter 1. Finite Automaton..............................................07
1.1 Introduction: Symbol, Alphabet, String, Prefix and Suffix of Strings,
1.2 Deterministic finite Automaton – Definition, and Examples.
1.3 Nondeterministic finite automaton – Definition and Examples.
1.4 NFA To DFA (NFA without Epsilon)
1.5 Finite automaton with output – Moore machine and Mealy machine,
Definition and Ex
amples.
1.6 Difference between Moore machine and Mealy machine
1.7 Minimization of DFA, Algorithm and Problem using Table Method.

Chapter 2. Regular Expressions and Languages..............42
2.1 Regular Expressions (RE): Definition and Example
2.2 Regular language -Definition and Examples.
2.3 Conversion of RE to FA-Examples.
2.4 Pumping lemma for regular languages and applications.

Chapter 3. Context-Free Grammars and Languages.........55
3.1 Definition of CFG
3.1.1 Component
s: Non-terminals, Terminals, Production Rules,
Start Symbol
3.2 Simplification of CFG:
3.2.1 Removing Useless Symbols
3.2.2 Unit Production
3.2.3 ϵ-production
3.2.4 Nullable Sy
mbol.
3.3 Normal Forms: Chomsky Normal Form (CNF), Examples
3.4 Greibach Normal Form (GNF), Examples

Chapter 4. Push Down Automata.....................................77
4.1 Definition of PDA and examples
4.2 Construction of PDA using empty stack and final State method:
Examples using stack method.

Chapter 5. Turing Machine..............................................92
5.1 The Turing Machine Model, Definition and Design of TM
5.2 Problems on language recognizers.
5.3 Language accepted by TM

💬

Chat with us