Theory of Computation Simplified: Simulate Real-world Computing Machines and Problems with Strong Principles of Computation (English Edition)

A theory behind computing machines

 

KEY FEATURES  

● Algorithmic 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.

 

DESCRIPTION 

The 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 LEARN

● Create 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 FOR

This 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.


 

 

 

1142075760
Theory of Computation Simplified: Simulate Real-world Computing Machines and Problems with Strong Principles of Computation (English Edition)

A theory behind computing machines

 

KEY FEATURES  

● Algorithmic 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.

 

DESCRIPTION 

The 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 LEARN

● Create 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 FOR

This 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.


 

 

 

9.95 In Stock
Theory of Computation Simplified: Simulate Real-world Computing Machines and Problems with Strong Principles of Computation (English Edition)

Theory of Computation Simplified: Simulate Real-world Computing Machines and Problems with Strong Principles of Computation (English Edition)

Theory of Computation Simplified: Simulate Real-world Computing Machines and Problems with Strong Principles of Computation (English Edition)

Theory of Computation Simplified: Simulate Real-world Computing Machines and Problems with Strong Principles of Computation (English Edition)

eBook

$9.95 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers

LEND ME® See Details

Overview

A theory behind computing machines

 

KEY FEATURES  

● Algorithmic 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.

 

DESCRIPTION 

The 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 LEARN

● Create 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 FOR

This 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.


 

 

 


Product Details

BN ID: 2940166487537
Publisher: BPB Publications
Publication date: 08/23/2022
Sold by: Draft2Digital
Format: eBook
File size: 10 MB
From the B&N Reads Blog

Customer Reviews