Automata and Computability
О овој е-књизи
This book begins by giving prerequisites for the subject, like strings, languages, types of automata, deterministic and non-deterministic automata. It proceeds forward to discuss advanced concepts like regular expressions, context free grammar and pushdown automata.
The text then goes on to give a detailed description of context free and non context free languages and Turing Machine with its complexity.
This compact and well-organized book provides a clear understanding of the subject with its emphasis on concepts along with a large number of examples.
Откријте још
О аутору
Prof. Anuradha A. Puntambekar worked as an assistant professor in Vishwakarma Institute of Technology (VIT) and PES Modern College of Engineering, Pune. She was an active member in framing the university syllabus. She was very popular among the students due to her unique teaching style and in-depth knowledge of various subjects. She researched 'Heterogeneous clustering,' during which her research papers were published and presented in a national symposium. She has expertise in different topics like - Data structures, Compiler design, Theory of computation, Design, and analysis of algorithms, Object-oriented programming, Database management systems, and Web technologies. Due to her dedicated teaching and learning abilities, she has got an overwhelming response to her books on the subjects mentioned above in India's different universities. She has a total of 22 years of teaching and writing experience in the field of computer engineering.
