Introduction to automata theory, languages, and computation / John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman.

By: Hopcroft, John E [author]Contributor(s): Motwani, Rajeev [co-author] | Ullman, Jeffrey D [co-author]Material type: TextTextPublication details: Boston : Addison-Wesley, ©2001Edition: Second edition; Low price editionDescription: xiv, 521 pages : illustrations ; 25 cmISBN: 978-0201441246Subject(s): MACHINE THEORY | FORMAL LANGUAGES | COMPUTATIONAL COMPLEXITYLOC classification: QA 267 .H67 2001
Contents:
Automata: The Methods and the Madness -- Finite Automata -- Regular Expressions and Languages -- Properties of Regular Languages -- Context-Free Grammars and Languages -- Pushdown Automata -- Properties of Context-Free Languages.
Summary: It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Home library Collection Shelving location Call number Copy number Status Date due Barcode
Books Books LRC - Main
National University - Manila
Machine Learning General Circulation GC QA 267 .H67 2001 (Browse shelf (Opens below)) c.1 Available NULIB000007793

Includes bibliographical references (pages 510-511) and index.

Automata: The Methods and the Madness -- Finite Automata -- Regular Expressions and Languages -- Properties of Regular Languages -- Context-Free Grammars and Languages -- Pushdown Automata -- Properties of Context-Free Languages.

It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material.

There are no comments on this title.

to post a comment.

© 2021 NU LRC. All rights reserved.Privacy Policy I Powered by: KOHA