000			01949nam a22003858i 4500
001			CR9781107325630
003			UkCbUP
005			20201015164344.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			130129s1985||||enk o ||1 0|eng|d
020			_a9781107325630 (ebook)
020			_z9780521302456 (hardback)
020			_z9780521177337 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA9.59 _b.S25 1985
082	0	0	_a511 _219
100	1		_aSalomaa, Arto, _eauthor.
245	1	0	_aComputation and automata / _cArto Salomaa.
246	3		_aComputation & Automata
264		1	_aCambridge : _bCambridge University Press, _c1985.
300			_a1 online resource (xiii, 284 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aEncyclopedia of mathematics and its applications ; _vvolume 25
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aIn 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.
650		0	_aComputable functions.
650		0	_aComputational complexity.
650		0	_aSequential machine theory.
776	0	8	_iPrint version: _z9780521302456
830		0	_aEncyclopedia of mathematics and its applications ; _vv. 25.
856	4	0	_uhttps://doi.org/10.1017/CBO9781107325630
999			_c121237 _d121237