Elements of a PDM and the equivalence between CFG and PDA.
While classic texts like Sipser or Peter Linz are standard references, Kulkarni’s book is noted for its lucid language and heavy emphasis on solving problems rather than just presenting theory. It is particularly popular among Indian engineering students as it aligns closely with local university syllabi, such as those of Pune University . Accessing the PDF Theory of Computation: 9780198084587 - Amazon.com
The by Vivek Kulkarni , published by Oxford University Press in 2013, is a widely used textbook for undergraduate students in computer science and engineering. It is designed to simplify complex mathematical concepts like automata theory, formal languages, and computational complexity. Key Details of the Book Title: Theory of Computation
Vivek Kulkarni , Principal Architect at Persistent Systems Ltd. Publisher: Oxford University Press (OUP India) Publication Date: August 31, 2013 ISBN-13: 978-0198084587 Pages: Approximately 560 pages Core Topics Covered
DFA, NFA, Moore and Mealy machines, and state minimization.
Features alternative models like Markov and labelled Markov algorithms . Distinctive Features
Equivalence with finite automata and the Pumping Lemma for Regular Languages .
