Computation and automata
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.
Kategori:
Tahun:
1985
Penerbit:
Cambridge University Press
Bahasa:
english
Halaman:
290
ISBN 10:
0521302455
ISBN 13:
9780521302456
Nama seri:
Encyclopedia of mathematics and its applications 25
File:
DJVU, 3.11 MB
IPFS:
,
english, 1985