Theory Of Computation Simplified
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
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
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.govBook 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
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 ArenT Predictable.Create Regular Expressions In Any Language.Convert Context-Free Grammar To Chomsky And GreibachS 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
Shop The Full Collection