Computation and Automata

Encyclopedia of Mathematics and its Applications #25

by Arto Salomaa

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.

300 pages, Hardcover

First published January 1, 1985

About the author

Arto Kustaa Salomaa was a Finnish mathematician and computer scientist. His research career, which spanned over 40 years, was focused on formal languages and automata theory.