Theory of Computation Simplified (Paperback)

Language: English

Published by BPB Publications, New Delhi, 2022

9355510640 / 9789355510648

  • Softcover
  • New
See all details

Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail

5-star seller

AbeBooks seller since October 12, 2005

Softcover

Condition: New

£ 50.62

 Free Shipping 
Ships within U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

Paperback. A theory behind computing machinesKey FeaturesAlgorithmic ideas are made simple to understand through the use of examples.Contains a wide range of examples and solutions to help students better grasp the concepts.Designed to assist and coach students in applying the fundamentals of computation theory in real-world situations. DescriptionThe book is geared toward those who thirst for computation theory knowledge. To cater to the demands of a wide range of people, the principles in this book are explained in a way that is easy to understand, digest and apply in the upcoming career.The 'Theory of Computation' is the foundational and mathematical topic in computer science, computer applications, computer Engineering, and software engineering. This book provides a clear introduction to the fundamental principles, followed by an in-depth mathematical study and a wealth of solved problems. Before reading this book, learners must understand basic sets, functions, trees, graphs and strings. The book as a whole acquaints the reader with automata theory fundamentals. The book provides simplified theoretical coverage of the essential principles, solve instances, and solve multiple-choice problems with solutions. The theory and computation of automata presented in this book will greatly assist students and professors alike.What you will learnCreate finite automata that aren't predictable.Create regular expressions in any language.Convert context-free grammar to Chomsky and Greibach's normal forms.Build deterministic and non-deterministic pushdown automata for the regular expression.Know the difference between decidability and computability.Create a Turing machine based on a specified regular expression. Who this book is forThis book is suitable for undergraduate and graduate students in computer science, information technology and software engineering with a basic understanding of set theory and boolean logic.Table of Contents1. Finite Automata2. Non-Deterministic Finite Automata3. Regular Expressions4. Context Free Grammar5. Regular Language6. Push Down Automata7. Post Machines8. Turing Machines9. Computability and Undecidability10. Complexity Theory: Advanced PerspectiveRead more A comprehensive book on computation theory covering topics such as finite automata, regular expressions, pushdown automata, Turing machines, and complexity theory. Geared towards students in computer science and software engineering. Provides clear explanations, examples, and solutions to aid in understanding and application. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Seller Inventory # 9789355510648

Title
Theory of Computation Simplified (Paperback)
Author
Dr. Varsha H. Patil Dr. Vaishali S. Pawar
Publisher
BPB Publications, New Delhi
Publication year
2022
Condition
new
Binding
Paperback
Language
English
ISBN 10
9355510640
ISBN 13
9789355510648

Grand Eagle Retail

Bensenville, IL, U.S.A.

5-star seller

AbeBooks seller since October 12, 2005

Shipping rates within U.S.A.

Item6 to 14 business days6 to 16 business days
First item£ 0.00£ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Seller's business information

APOLLO ONLINE CORP.

605 Geddes Street
Wilmington, DE U.S.A. 19805