An introduction to formal languages and automata / Peter Linz.

By:

Linz, Peter

Material type: Text

TextPublication details: Sudbury, MA : Jones & Bartlett Learning, c2012.Edition: 5th edDescription: xiii, 437 p. : ill. ; 25 cm. +; 1 CD-ROM (4 3/4 in.)ISBN:

9781449615529
144961552X
9789380853284

Subject(s):

DDC classification:

005.131 22 LIN

Contents:

Introduction to the Theory of Computing Finite Automata Regular Languages and Regular Grammars Properties of Regular Languages Context-Free Languages Simplifications of Context-free Grammars and Normal Forms Pushdown Automata Properties of Context-Free Languages Turing Machines Other Models of Turing Machines A Hierarchy of Formal Languages and Automata Limits of Algorithmic Computation Other Models of Computation An Overview of Computational Complexity

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

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
General Books	CUTN Central Library Generalia	Non-fiction	005.131 LIN (Browse shelf(Opens below))	Available		28360

Browsing CUTN Central Library shelves, Shelving location: Generalia, Collection: Non-fiction Close shelf browser (Hides shelf browser)

Previous								Next
Previous	005.131 KRI Introduction to formal languages, automata theory and computation :	005.131 KRI Introduction to formal languages, automata theory and computation :	005.131 LIN An introduction to formal languages and automata	005.131 LIN An introduction to formal languages and automata /	005.133 BRO A First Book of C++ /	005.133 DAL C++ plus data structures /	005.133 DAW Python programming for the absolute beginner	Next

It presents all material essential to an introductory Theory of Computation course. Includes a new chapter on finite-state transducers and an introduction to JFLAP.

Introduction to the Theory of Computing
Finite Automata
Regular Languages and Regular Grammars
Properties of Regular Languages
Context-Free Languages
Simplifications of Context-free Grammars and Normal Forms
Pushdown Automata
Properties of Context-Free Languages
Turing Machines
Other Models of Turing Machines
A Hierarchy of Formal
Languages and Automata
Limits of Algorithmic Computation
Other Models of Computation
An Overview of Computational Complexity

Includes bibliographical references (p. 431) and index.

There are no comments on this title.

to post a comment.