Top-down and bottom-up parsing, including LL and LR parsing.
Elements of a PDM and the equivalence between CFG and PDA.
Uses plenty of solved examples, flowcharts, and diagrams. Exercises are graded according to Bloom's taxonomy. Theory Of Computation Book By Vivek Kulkarni Pdf
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
Equivalence with finite automata and the Pumping Lemma for Regular Languages . Top-down and bottom-up parsing, including LL and LR parsing
Procedures are represented in algorithmic form, allowing readers to implement them in any programming language.
The book follows a structured approach, starting with fundamental mathematical concepts before moving into advanced computational models: Exercises are graded according to Bloom's taxonomy
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
Symbols, alphabets, sets, relations, and graphs.