Introduction to Theory of Computation
by Anil Maheshwari, Michiel Smid
Publisher: Carleton University 2012
Number of pages: 246
This is a free textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and the Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.
Home page url
Download or read it online for free here:
by V. E. Wolfengagen - JurInfoR
This work covers the advanced topics in main ideas of computing in general. Material is especially useful for the instructor, postgraduate and graduate students of IT-specialties and is suitable for the system of training of specialists.
by Stephen Wolfram - Westview Press
These original papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for computer science, physics, economics, biology, and many other areas.
by Christian P. Robert - arXiv
We will first present the most standard computational challenges met in Bayesian Statistics, focusing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.
by Eitan Gurari - Computer Science Pr
The book explores questions and terminologies concerning programs, computers, and computation. The exploration reduces to a study of mathematical theories, such as those of automata and formal languages, theories interesting in their own right.