Sermutlu E Automata, Formal Languages, and Turing Machines 2020

Textbook in PDF format

The subject matter of this book is about the theoretical foundations of computer science. It gives us an idea about what any computer program can or cannot do. This book strikes a balance between theory and applications, mathematical concepts and practical consequences for computer programs, and the usual dilemma of any textbook, that of going to greater depths or covering a wider range of topics. The gently sloping learning curve is especially suitable for self-study.
Preface.
Finite Automata.
Nondeterminism.
Regular Languages.
Regular Expressions.
Pumping Lemma.
Context-Free Grammars.
Different Forms of Grammars.
Pushdown Automata.
Non-Context-Free Languages.
Turing Machines - I.
Turing Machines - II.
An Undecidable Language.
P and NP.
NP–Complete Problems.
References.
Index