Introduction to Theory of Automata, Formal Languages and Computation

Introduction to Theory of Automata, Formal Languages and Computation

$4.13
Sale price  $4.13 Regular price  $4.13
Skip to product information
Introduction to Theory of Automata, Formal Languages and Computation

Introduction to Theory of Automata, Formal Languages and Computation

$4.13
Sale price  $4.13 Regular price  $4.13
SKU: DADAX8120348079
ISBN: 9788120348073
Publisher: PHI
Availability: In Stock
Payment methods
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Sold by Ergodemedia, an authorized reseller of Authentic New & Used Books with Free US Shipping.

30-day returns by mail  ·  Refunded to original payment method  |  support@ergodemedia.com

✓ Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch via USPS / UPS
  • Securely packed to ensure your book arrives in the described condition
  • Tracking number sent via email once dispatched
  • Taxes calculated at checkout. International shipping not available.
Returns & Refund

Returns accepted within 30 days of delivery. Returns are processed by mail. Refunds are issued to the original payment method within 5–7 business days of receiving the returned item.

Damaged, Defective or Misrepresented Item

Free return shipping by mail · Full refund to original payment method

Wrong Item Received

Free return shipping by mail · Full refund or replacement at your choice

Change of Mind

Return shipping at customer's expense · Book must be in the same condition as received · Refund to original payment method

All returns require a Return Authorization (RA) number before sending. Original shipping charges are non-refundable.

To initiate a return, contact us:

support@ergodemedia.com +1 832-802-7787
View Full Return & Refund Policy
Safety & Compliance
⚠️

California Proposition 65 Warning

Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

www.P65Warnings.ca.gov
📖

Book Condition & Care Notice

Used books are graded and described accurately — condition details are listed on each product page. Books may contain previous owner's handwriting, highlights, or stamps unless stated as new. Store books away from direct sunlight and moisture to preserve their condition.

New books are sealed or unread. Used books are inspected before dispatch.

ℹ️

Product Authenticity & Notice

All books sold by Ergodemedia are 100% authentic, sourced directly from publishers and trusted distributors. Book condition is accurately graded and described. Some books may contain previous owner's markings or inscriptions.

Ergodemedia — Authentic New & Used Books. Free US Shipping. Delivered to Your Door.

Description

About the Book : The Theory of Computation or Automata and Formal Languages assumes significance as it has a wide range of applications in complier design, robotics, Artificial Intelligence (AI), and knowledge engineering. This compact and well-organized book provides a clear analysis of the subject with its emphasis on concepts which are reinforced with a large number of worked-out examples. The book begins with an overview of mathematical preliminaries. The initial chapters discuss in detail about the basic concepts of formal languages and automata, the finite automata, regular languages and regular expressions, and properties of regular languages. The text then goes on to give a detailed description of context-free languages, pushdown automata and computability of Turing machine, with its complexity and recursive features. The book concludes by giving clear insights into the theory of computability and computational complexity. This text is primarily designed for undergraduate (BE/B.Tech.) students of Computer Science and Engineering (CSE) and Information Technology (IT), postgraduate students (M.Sc.) of Computer Science, and Master of Computer Applications (MCA). Contents : Preface Acknowledgements 1. Preliminary Mathematical Review 2. Three Basic Concepts: Grammar, Languages and Automata 3. Finite Automata 4. Regular Languages and Regular Grammars 5. Properties of Regular Languages 6. Context-Free Languages 7. Pushdown Automata 8. Properties of Context-Free Languages 9. Turing Machine 10. Other Models of Turing Machines 11. Hierarchy of Formal Languages and Linear Bounded Automata 12. Undecidability 13. Theory of Computability 14. Computational Complexity

⚠️
Product Notice This book is sold in used condition unless explicitly stated as new. Condition is graded and described accurately. Some books may contain previous owner's markings, highlights, or inscriptions. This product may contain chemicals known to the State of California to cause cancer or reproductive harm. For more information visit www.P65Warnings.ca.gov

Shop The Full Collection

You may also like!