Computation and Automata
Computation and Automata by Arto Salomaa is a comprehensive introduction to key mathematical topics relevant to theoretical computer science. Published by Cambridge University Press on April 28, 2011, this reissue spans 300 pages and is presented in English. The book covers essential areas such as computability, recursive functions, formal languages, automata, computational complexity, and cryptography, providing a solid foundation for readers.
In this edition, readers will find a self-contained presentation that includes detailed proofs for all statements, making complex concepts accessible. The text begins with fundamental principles and advances to significant recent developments in the field. With a focus on mathematics, discrete mathematics, and probability and statistics, this book serves as a valuable resource for those looking to deepen their understanding of theoretical computer science.
Official synopsis Publisher
This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. 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.
Publisher
Topics
FAQ
What is “Computation and Automata” about?
Who is the author of “Computation and Automata”?
When was “Computation and Automata” published?
What is the ISBN for “Computation and Automata”?
What are the book details (language, pages, edition)?
