Vendido directamente por la editorial independiente
BSP Books
Sobre este libro
The book is designed to serve as a textbook for a single-semester undergraduate course on formal languages and automata theory. The book introduces the reader to the fundamentals of theory of computation. Beginning with finite automata and regular grammars, the book goes on to discuss context-free grammars, push down automata, and Turing machines. Dedicated chapters on undecidability, Chomsky hierarchies and linear bound automata, and intractable problems make this a complete text on automata theory. Written in an easy-to-understand manner, the book includes a large number of solved examples which illustrate problem-solving methodology.Besides providing readers with a detailed introduction to the theories related to computer science, this book also fully covers mathematical preliminaries which are essential to computation. Solved examples have been included over the course of the book for every chapter, separate previous gate questions and their solutions are given to help students in improve their knowledge of the concepts they learn in each chapter. In order to help improve the problem-solving capabilities of students, the author has also made sure that every chapter in this book includes objective-type questions.
Table of Contents | : | Click here
Chapter1 | : | Click here
Contents:
Chapter 1: Basic Mathematical Techniques, Chapter 2: Formal Languages, Chapter 3: Finite Automata, Chapter 4: Regular Languages and Finite Automata, Chapter 5: Context Free Grammars and Languages, Chapter 6: Push Down Automata, Chapter 7: Turing Machines, Chapter 8: Computability Theory, Answers to Objective Type Questions, Gate Solved Questions 2007 to 2014.
About the Author
Prof. E. Sreenivasa Reddy, presently working as DEAN, Faculty of Engineering, Acharya Nagarjuna University completed his B.Tech in ECE from ANU, Guntur, Masters degree (M.S) in Electronics from BITS, PILANI, M.Tech from VTU in Computer Science and completed Ph.D in Computer Science from ANU. He has 24 years of teaching experience and 10 years of research experience. He produced two Ph.Ds and two M.Phil’s so far. His areas of interests are Image Processing, Machine learning, Pattern Recognition, Microprocessors etc. Recognized as Research Expert by IMARAT (a DRDO Unit), Hyderabad, A. P. India. Recognized as Research supervisor by JNIAS, Hyderabad. He had published more than 50 journal papers and presented more than 50 conference papersand written 5 books for engineering students on Microprocessors, Design Analyis of algorithms, C programming etc. He also produced Audio/Video lessons on many subjects. He was the editor of ANU Engineering Journal and member of editorial boards of many journals like International Journal of Video, Image, Signal & Audio (VISA) Processing, published by Global Research
Publications, New Delhi, The International Journal of Computational Intelligence Techniques, International Journal of Image Processing, Journal of Theoretical and Applied Information Technology, International Journal of Reviews in Computing.
Disponibilidad
Formal Languages and Automata Theory está disponible como PDF en 31 librerías online.
Entre las librerías que lo venden están BSP Books, Alpha Books, Bajalibros Argentina.
Cómpralo directamente a su editorial en BSP Books.
¿En qué formatos está disponible Formal Languages and Automata Theory?
Formal Languages and Automata Theory está disponible como PDF en 31 librerías online.
¿Dónde puedo comprar Formal Languages and Automata Theory?
Puedes comprar Formal Languages and Automata Theory en BSP Books, Alpha Books, Bajalibros Argentina. Compara todas las opciones en la lista de esta página.
¿Cuánto se tarda en leer Formal Languages and Automata Theory?
Los lectores de las librerías de Publica.la pasan de media unas 26 min con Formal Languages and Automata Theory.
Valoraciones y reseñas
Aún no hay valoraciones. Sé el primero en reseñar este libro.