Theory of Computation Simplified (häftad, eng)
Gäller medlemspriset
Black Week
Theory of Computation Simplified (häftad, eng)
Gästpris:
Ditt pris:
410 kr
499 kr
Du sparar
89 kr
- Inköpspriser för medlemmar (Logga in)
- Frakt från 0 kr
- 14 dagars öppet köp
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
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
| Format | Häftad |
| Omfång | 620 sidor |
| Språk | Engelska |
| Förlag | BPB Publications |
| Utgivningsdatum | 2022-09-23 |
| ISBN | 9789355510648 |
Artikelnummer
2867946
EAN
9789355510648
Leverans:
Denna produkt skickas från oss inom 4 - 5 vardagar. I kassan väljer du om du vill få leverans med Budbee, Airmee, Best Transport, Early Bird, Postnord eller DB Schenker. Vissa speditörer har vikt- eller storleksbegränsningar och kan av den anledningen saknas som alternativ i kassan om du handlar många eller väldigt stora produkter.Fri retur:
För Plus-medlemmar gäller fri retur och 14 dagars full returrätt från den dagen du tar emot din leverans. För övriga kostar retur från 49 kr.Undantag för retur- och ångerrätt:
Dessa är exempel på varor som inte omfattas av retur- eller ångerrätt. Observera att det kan finnas andra undantag som inte listas här.- Använda, skadade och/eller inkompletta produkter
- Dagligvaror (livsmedel, läkemedel, nikotinprodukter)
- Hygienartiklar & kroppsnära produkter (rakapparater, in ear-hörlurar, aktivitetsklockor)
- Intimprodukter (menskoppar, kondomer och glidmedel)
- Kosmetikprodukter (inkl. hår- och hudvårdsprodukter, parfymer, etc.)
- Underkläder (inkl. badkläder, underställ och strumpor)
- Ljud- & bildupptagningar, spel/program (om förseglingen brutits eller licensnyckeln erhållits.)
- Teknikprodukter om försegling brutits eller programvara har installerats (mobiltelefoner, surfplattor, laptops, etc.)
- Gratisprodukter
Om du är osäker på om en produkt omfattas av ångerrätt kan du alltid kontakta vår kundtjänst på info@buyersclub.se, så hjälper vi dig gärna!
Leveranser:
