Finite automata and regular expressions are two equivalent models of computation that can be used to recognize regular languages. Regular expressions are a formal way of describing regular languages using a set of operators and symbols.
The text spans 560 pages and takes a structured approach to the study of abstract machines and the computational problems they can solve. Kulkarni, a Principal Architect at Persistent Systems, leverages over 18 years of industry and academic experience to present procedures in clear algorithmic forms rather than just abstract proofs. Oxford University Press Publication Date: August 31, 2013 ISBN-13: 978-0198084587 Format: Available in Hardcover and Paperback Key Features and Pedagogy theory of computation book by vivek kulkarni pdf link
It covers the standard curriculum found in major universities and competitive exams (such as GATE in India). Key chapters include: Finite automata and regular expressions are two equivalent
If you're looking for a solid way to share or find the book by Vivek Kulkarni a Principal Architect at Persistent Systems
: Hardcover "International Editions" are often listed for approximately $39.13 .