Amazon cover image
Image from Amazon.com
Image from Coce

Theory of automata and computation / Adesh Kumar Pandey.

By: Material type: TextTextPublisher: New Delhi, India : S.K. Kataria & Sons, 2011 ; Reprint 2022Edition: First editionDescription: 315 pages : illustrations ; 24 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9789350141571
Subject(s): DDC classification:
  • 005.131 P192t 23
LOC classification:
  • QA267 .P362011
Contents:
Section-A: Finite automata -- Regular expression -- Introduction to machines -- Section-B: Properties of regular sets -- Context-free grammars and languages -- Simplified context-free grammar and its normal form -- Section-C: Pushdown automata -- Properties of context-free languages -- Turing machine -- Section-D: Chomsky heirarchies -- Computability and recursive function theory.
Summary: "The book addresses a full spectrum of automata theory concepts used in computer science. Each of these concepts is presented in detail, since these concepts are basis of computer science and provide the basics for developing software techniques like designing and checking the behaviour of digital circuits, lexical-analyser of the typical compiler, and software for Natural Language Processing. To introduce the more formal aspects of Computer Science, the author has presented automata as foundation. For students who are ambitious to achieve unparalleled goals in the field of computer science, and want to develop their programming skills towards system programming, it becomes necessary that their mathematical concept are very clear"-- Preface of the book.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Shelving location Call number Copy number Status Date due Barcode
Books Books Main Library Circulation Section CIR 005.131 P192t 2011 (Browse shelf(Opens below)) 1-1 Available 031911

Includes index.

Section-A: Finite automata -- Regular expression -- Introduction to machines -- Section-B: Properties of regular sets -- Context-free grammars and languages -- Simplified context-free grammar and its normal form -- Section-C: Pushdown automata -- Properties of context-free languages -- Turing machine -- Section-D: Chomsky heirarchies -- Computability and recursive function theory.

"The book addresses a full spectrum of automata theory concepts used in computer science. Each of these concepts is presented in detail, since these concepts are basis of computer science and provide the basics for developing software techniques like designing and checking the behaviour of digital circuits, lexical-analyser of the typical compiler, and software for Natural Language Processing. To introduce the more formal aspects of Computer Science, the author has presented automata as foundation. For students who are ambitious to achieve unparalleled goals in the field of computer science, and want to develop their programming skills towards system programming, it becomes necessary that their mathematical concept are very clear"-- Preface of the book.

There are no comments on this title.

to post a comment.