Normal view MARC view ISBD view

Introduction to automata theory, languages, and computation

By: Hopcroft, John E.
Contributor(s): Motwani, Rajeev | Ullman, Jeffrey D.
Publisher: Noida Pearson Education 2008Edition: 3rd.Description: xvi, 487pg. | Binding - Paperback |.ISBN: 9788131720479.Subject(s): Computer Engineering | Finite Automata | Context-Free Grammars and Languages | Undecidability | Pushdown AutomataDDC classification: 006.3 Summary: 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. CONTENT: 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 Introduction to Turing Machines Undecidability Intractable Problems Additional Classes of Problems Index
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 location Collection Call number Status Date due Barcode Item holds
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E14470
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E14471
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E14472
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E14473
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E14474
 Text Books Text Books School of Engineering & Technology
Reference Section
Reference 006.3 HOP/MOT (Browse shelf) Not For Loan E8449
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8450
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8451
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8452
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8453
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8454
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8455
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8456
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8457
 Text Books Text Books School of Engineering & Technology
General Stacks
Circulation 006.3 HOP/MOT (Browse shelf) Available E8458
Total holds: 0

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.



CONTENT:
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
Introduction to Turing Machines
Undecidability
Intractable Problems

Additional Classes of Problems
Index

There are no comments for this item.

Log in to your account to post a comment.
Unique Visitors hit counter Total Page Views free counter
Implemented and Maintained by AIKTC-KRRC (Central Library).
For any Suggestions/Query Contact to library or Email: librarian@aiktc.ac.in | Ph:+91 22 27481247
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha