Introduction to Theory of Computation
A free textbook for an undergraduate course on the Theory of Computation at Carleton University.
Tag(s): Theory of Computation
Publication date: 11 Apr 2016
ISBN-10: n/a
ISBN-13: n/a
Paperback: 252 pages
Views: 14,785
Type: N/A
Publisher: n/a
License: Creative Commons Attribution-ShareAlike 4.0 International
Post time: 29 Apr 2016 12:00:00
Introduction to Theory of Computation
A free textbook for an undergraduate course on the Theory of Computation at Carleton University.
Publication date: 11 Apr 2016
ISBN-10: n/a
ISBN-13: n/a
Paperback: 252 pages
Views: 14,785
Document Type: N/A
Publisher: n/a
License: Creative Commons Attribution-ShareAlike 4.0 International
Post time: 29 Apr 2016 12:00:00
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material for any purpose, even commercially.
The licensor cannot revoke these freedoms as long as you follow the license terms.
Click here to read the full license.
Anil Maheshwari and Michiel Smid wrote:This is a free textbook for an undergraduate course on the Theory of Computation, which we have been teaching at Carleton University since 2002. Until the 2011/2012 academic year, this course was offered as a second-year course (COMP 2805) and was compulsory for all Computer Science students. Starting with the 2012/2013 academic year, the course has been downgraded to a third-year optional course (COMP 3803).
We have been developing this book since we started teaching this course. Currently, we cover most of the material from Chapters 2–5 during a 12-week term with three hours of classes per week.
Tweet
About The Author(s)
Anil Maheshwari is a Professor in the School of Computer Science at Carleton University. His main interest is in all sorts of algorithmic problems in computational geometry and graph theory. He is interested in sequential, parallel, distributed, multi-core, external memory, big and small data algorithms for problems which fit within the framework of design and analysis of algorithms.
Anil Maheshwari is a Professor in the School of Computer Science at Carleton University. His main interest is in all sorts of algorithmic problems in computational geometry and graph theory. He is interested in sequential, parallel, distributed, multi-core, external memory, big and small data algorithms for problems which fit within the framework of design and analysis of algorithms.
Michiel Smid is a Professor in the School of Computer Science at Carleton University. His research interests include Algorithms, Applications of Computational Geometry in Manufacturing, Computational Geometry, Data Structures, Discrete Mathematics, Geometric Networks, Graph Theory, and Theory of Computing.
Michiel Smid is a Professor in the School of Computer Science at Carleton University. His research interests include Algorithms, Applications of Computational Geometry in Manufacturing, Computational Geometry, Data Structures, Discrete Mathematics, Geometric Networks, Graph Theory, and Theory of Computing.