000			01467nam a22003257a 4500
999			_c73308 _d73308
003			CITU
005			20230215082129.0
007			cr an aaaaaaaa
008			210816b ||||| |||| 00| 0 eng d
020			_a9781107087583
020			_a9781107325630
041			_aeng
082			_a511
100	1		_aSalomaa, Arto. _eauthor
245			_aComputation and automata / _cArto Salomaa.
264		1	_aCambridge: _bCambridge University Press, _cc2013
300			_a1 online resource (xiii, 284 pages) : _billustrations ;
336			_2rdacontent _atext _btext
337			_2rdamedia _acomputer _bc
338			_2rdacarrier _aonline resource _bcr
500			_aIncludes index.
504			_aBibliography: p. 269-277.
505			_aEditor's statement Foreword G. Rozenberg Acknowledgments 1. Introduction: models of computation 2. Rudiments of language theory 3. Restricted automata 4. Turing machines and recursive functions 5. Famous decision problems 6. Computational complexity 7. Cryptography 8. Trends in automata and language theory Historical and bibliographical remarks References Index.
650		0	_aComputable functions.
650		0	_aComputational complexity.
650		0	_aSequential machine theory.
655		0	_aElectronic books.
856			_yFull text available at Cambridge University Press Click here to view _uhttps://www.cambridge.org/core/books/computation-and-automata/D1F8D3A736DE832A95F252B1EEAEA99C
942			_2ddc _cER