Search:

Computation and automata

Format Post in Antique Books BY Arto Salomaa

0521302455 Shared By Guest

Computation and automata Arto Salomaa is available to download <table><tr><td colspan="2"><strong style="font-size:1.This material is available do download at niSearch.com on Arto Salomaa's eBooks, 2em;">Computation and automata</strong><br/>Arto Salomaa</td></tr> <tr> <td><b>Type:</b></td> <td>eBook</td> </tr> <tr> <td><b>Released:</b></td> <td>1985</td> </tr> <tr> <td><b>Publisher:</b></td> <td>Cambridge University Press</td> </tr> <tr> <td><b>Page Count:</b></td> <td>290</td> </tr> <tr> <td><b>Format:</b></td> <td>djvu</td> </tr> <tr> <td><b>Language:</b></td> <td>English</td> </tr> <tr> <td><b>ISBN-10:</b></td> <td>0521302455</td> </tr> <tr> <td><b>ISBN-13:</b></td> <td>9780521302456</td> </tr> </table> This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography.Computation and automata Textbook The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science. Book Description In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography.

Comments (0)

Currently,no comments for this book!