Search | About | Preferences | Interact | Help | ||
150 million books. 1 search engine. |
› Find signed collectible books: 'Introduction to Automata Theory, Languages, and Computation'
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.
More editions of Introduction to Automata Theory, Languages, and Computation:
› Find signed collectible books: 'Introduction to Automata Theory, Languages,And Computation (3rd Edition)'
Used Book Highlights first and second pages, standard shipping 18 -21 business days, for fast delivery choose expedited shipping 5 -7 business days, ship from India.
More editions of Introduction to Automata Theory, Languages,And Computation (3rd Edition):
› Find signed collectible books: 'Randomized Algorithms'
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.
More editions of Randomized Algorithms:
Founded in 1997, BookFinder.com has become a leading book price comparison site:
Find and compare hundreds of millions of new books, used books, rare books and out of print books from over 100,000 booksellers and 60+ websites worldwide.