Description
The book is all about the automata, formal language theory and computability. Automata
theory plays important roles in compilers, text processing, programming languages,
hardware designs, artificial intelligence and is the core base of computer science
studies. The intent is to make automata theory interesting and challenging and break the
myth of being a tough topic. For that matter, topics are covered in an easy-to-understand
manner with the help of elaborative and well-scripted examples. For topics which are
little complex and fuzzy to understand, strategy adopted is to connect the topic with the
everyday problems we encounter, in order to develop a connective understanding of the
topic and get a clear view of the topic. Exercise questions are provided with the answers
to understand the solution easily.
Shivam Saxena is a Computer Science Engineer and an academician in the field of
theoretical computer science. His main subjects of interest are Computation and
complexities, DNA Computing, Quantum Computation, NP-Complete Problems and Their
Heuristics, Graph Theory and Artificial Intelligence. Currently, he is involved in research for
finding Solutions to NP-Complete Problems.
