Introduction to Automata Theory, Languages, and Computation

Front Cover
Pearson/Addison Wesley, 2007 - Computers - 535 pages
2 Reviews
This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students. By using a series of root questions and hints, it not only tests a student's capability, but actually simulates a one-on-one teacher-student tutorial that allows for the student to more easily learn the material. Through the programming labs, instructors are capable of testing, tracking, and honing their students' skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered. For more information about Gradiance, please visit www.aw.com/gradiance.

From inside the book

What people are saying - Write a review

LibraryThing Review

User Review  - dominus - LibraryThing

(This is a review of the first edition of this book.) This is another one of those rotten books that is difficult to read even when you already know the subject matter backward and forward. One of the ... Read full review

LibraryThing Review

User Review  - dpf - LibraryThing

A strong text, but quite formal. Not the most readable. Read full review

Contents

The Methods and the Madness
1
Finite Automata
37
Regular Expressions and Languages
85
Copyright

9 other sections not shown

Other editions - View all

Common terms and phrases

About the author (2007)

fm.author_biographical_note1

Ullman is the Stanford W. Ascherman Professor of Computer Science at Stanford.

Bibliographic information