COMPUTER SCIENCE &

INFORMATION TECHNOLOGY

Theory of
Computation

Comprehensive Theory
with Solved Examples and Practice Questions

www.madeeasypublications.org
 MADE EASY Publications Pvt. Ltd.
Corporate Office: 44-A/4, Kalu Sarai (Near Hauz Khas Metro
Station), New Delhi-110016 | Ph. : 9021300500
Email : [email protected] | Web : www.madeeasypublications.org

First Edition : 2015

Theory of Computation Second Edition : 2016

Third Edition : 2017

EDITIONS
© Copyright by MADE EASY Publications Pvt. Ltd. Fourth Edition : 2018
All rights are reserved. No part of this publication may be Fifth Edition : 2019
reproduced, stored in or introduced into a retrieval system, Sixth Edition : 2020
or transmitted in any form or by any means (electronic, Seventh Edition : 2021
mechanical, photo-copying, recording or otherwise), Eighth Edition : 2022
without the prior written permission of the above mentioned Ninth Edition : 2023
publisher of this book.
Tenth Edition : 2024

MADE EASY Publications Pvt. Ltd. has taken due care

in collecting the data and providing the solutions, before
publishing this book. Inspite of this, if any inaccuracy or
printing error occurs then MADE EASY Publications Pvt.
Ltd. owes no responsibility. We will be grateful if you could
point out any such error. Your suggestions will be appreciated.
 Theory of Computation
CHAPTER 1 CHAPTER 3

Grammars, Languages & Automata����������������2-16 Context Free Languages & Push down
1.1 Introduction................................................................................. 2 Automata................................................... 141-184
1.2 Chomsky Hierarchy.................................................................... 6 3.1 Context Free Grammars...................................................... 141
1.3 Automaton.................................................................................... 7 3.2 Context Free Language....................................................... 149
1.4 Grammars...................................................................................... 9 3.3 Push Down Automata (PDA)............................................. 149

1.5 Equivalence of Languages, Grammars and Automata.. 9 3.4 Equivalence between CFL and CFG................................ 164
3.5 Closure Properties of CFL’s................................................. 164
1.6 Expressive Power of Automata............................................10
3.6 Closure Properties of DCFL’s ............................................. 167
1.7 Applications of Automata.....................................................10
3.7 Decision Properties of CFL’s............................................... 169
Student Assignments................................................................12
3.8 Non-Context Free Languages........................................... 173
3.9 Non-Regular Languages and CFL’s.................................. 173
CHAPTER 2 Student Assignments............................................................. 175

Regular Languages & Finite Automata........17-140

CHAPTER 4
2.1 Introduction...............................................................................17

2.2 Deterministic Finite Automata (DFA).................................19 REC, RE Languages & Turing Machines,
2.3 Non-deterministic Finite Automata Decidability......................................................185-230
4.1 Turing Machine (TM)............................................................ 185
(NFA or NDFA)............................................................................46
4.2 Turing Machine Construction........................................... 186
2.4 Epsilon NFA (e-NFA).................................................................61
4.3 Turing’s Thesis......................................................................... 190
2.5 Regular Expressions.................................................................62 4.4 Variation of Turing Machines............................................. 190
2.6 Equivalence between Finite Automata and Regular 4.5 A Universal Turing Machine............................................... 192

Expressions.................................................................................65 4.6 Countable and Uncountable Sets................................... 192

4.7 Recursively and Recursively Enumerable
2.7 Regular Grammar.....................................................................77
Languages................................................................................ 195
2.8 Closure Properties of Regular Languages.......................83 4.8 Closure Properties................................................................. 199
2.9 Identifying Non Regular Language....................................92 4.9 Some Decidable Problems (Recursive Languages) on
Turing Machines.................................................................... 203
2.10 Decision Properties of Regular Language.......................93
4.10 Chomsky Hierarchy Vs Other Classes............................. 204
2.11 Moore and Mealy Machines.................................................94 4.11 Decidability of Formal Languages................................... 205
2.12 Minimization of Finite Automata..................................... 103 4.12 Terminology of Problems................................................... 207

2.13 Myhill – Nerode Theorem................................................... 109 4.13 Important Points of Undecidability................................ 207
4.14 Reduction................................................................................. 209
Student Assignments............................................................. 113
Student Assignments............................................................. 212

iii