Introduction to automata theory, languages, and computation

By:

Hopcroft, John E

Contributor(s):

Ullman, Jeffrey D

Publication details: New Delhi : Narosa Publication, 1987.Description: 418 pages : ill.; 23 cmISBN:

8185015961

Subject(s):

DDC classification:

629.831 HOP

Contents:

Finite automata and regular expressions -- Properties of regular sets -- Context-free grammars -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Undecidability -- The Chomsky hierarchy -- Deterministic context-free languages -- Closure properties of families of languages -- Computational complexity theory -- Intractable problems -- Highlights of other important language classes.

Summary: This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Gratis, Gifts	IIITDM Kurnool General Stacks	Non-fiction	629.831 HOP (Browse shelf(Opens below))	Available		G000121

Browsing IIITDM Kurnool shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)

Previous		No cover image available	No cover image available					Next
Previous	629.47 HUG Spacecraft Attitude Dynamics	629.8 GUP INDUSTRIAL AUTOMATION AND ROBOTICS	629.8 GUP INDUSTRIAL AUTOMATION AND ROBOTICS	629.831 HOP Introduction to automata theory, languages, and computation	629.89 DUN Introduction to programmable logic controllers	629.89 HAC Programmable logic controllers :	629.89 HAC Programmable logic controllers :	Next

Finite automata and regular expressions --
Properties of regular sets --
Context-free grammars --
Pushdown automata --
Properties of context-free languages --
Turing machines --
Undecidability --
The Chomsky hierarchy --
Deterministic context-free languages --
Closure properties of families of languages --
Computational complexity theory --
Intractable problems --
Highlights of other important language classes.

This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.

There are no comments on this title.

to post a comment.