Salomaa, Arto, <br/><br/>
Computation and automata / 
 Computation & Automata 
Arto Salomaa. 
 - Cambridge :  Cambridge University Press,  1985. 
 - 1 online resource (xiii, 284 pages) :  digital, PDF file(s). 
 - Encyclopedia of mathematics and its applications ;  volume 25 .
 - Encyclopedia of mathematics and its applications ;  v. 25. .
<br/><br/> Title from publisher's bibliographic system (viewed on 05 Oct 2015). 
<br/><br/> 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. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field. 
<br/><br/><label>ISBN: </label>9781107325630 (ebook) 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computable functions.<br/>Computational complexity.<br/>Sequential machine theory.
<br/><br/><label>LC Class. No.: </label>QA9.59  / .S25 1985 
<br/><br/><label>Dewey Class. No.: </label>511