Preview "Theory of Automata, Formal Languages and Computation" in a new window.

Theory of Automata, Formal Languages and Computation

Authors

Book Description

This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.

In The Press

About the Author

Read on Your Favourite Devices

to find out more

Ebook Permissions

to find out more

About this Ebook

File formats
This ebook is available in:
The publisher has not yet supplied format information.
Pre-order formats shown are based on publisher intent and may change before release.
File sizes shown are an approximation. The actual download size will vary based on the application you use to read the book.
Publisher
Published
; Copyright:
ISBNs
Title
Series
Author
;
Edition
Imprint
Language
Number of Pages
Page count shown is an approximation provided by the publisher. The actual page count will vary based on various factors such as your device's screen size and font-size.