Please use this identifier to cite or link to this item: https://openlibrary-repo.ecampusontario.ca/jspui/handle/123456789/2460
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSmith, Taylor-
dc.date.accessioned2025-11-21T19:04:11Z-
dc.date.available2025-11-21T19:04:11Z-
dc.date.issued2024-09-
dc.identifier4bad5bea-0316-4a19-a018-213d62064940-
dc.identifier.urihttps://openlibrary-repo.ecampusontario.ca/jspui/handle/123456789/2460-
dc.description.tableofcontentsI. Regular Languagesen_US
dc.description.tableofcontentsII. Context-Free Languagesen_US
dc.description.tableofcontentsIII. Decidable and Semidecidable Languagesen_US
dc.description.tableofcontentsIV. Decision Problemsen_US
dc.description.tableofcontentsV. Proving Undecidabilityen_US
dc.language.isoengen_US
dc.relation.isformatofhttps://people.stfx.ca/tjsmith/pub/tocopen/en_US
dc.relation.haspartResources for Educators: Source Files | https://github.com/taylorjsmith/tocopenen_US
dc.rightsCC BY-SA | https://creativecommons.org/licenses/by-sa/4.0/en_US
dc.titleTheory of computing : An open introductionen_US
dc.typeLearning Objecten_US
dcterms.accessRightsOpen Accessen_US
dcterms.educationLevelUniversity - Undergraduateen_US
dcterms.educationLevelUniversity - Graduate & Post-Graduateen_US
dc.identifier.slughttps://openlibrary.ecampusontario.ca/catalogue/item/?id=4bad5bea-0316-4a19-a018-213d62064940-
ecO-OER.AdoptedNoen_US
ecO-OER.AncillaryMaterialYesen_US
ecO-OER.InstitutionalAffiliationSt. Francis Xavier Universityen_US
ecO-OER.ISNI0000 0004 1936 7363en_US
ecO-OER.ReviewedNoen_US
ecO-OER.AccessibilityStatementNoen_US
ecO-OER.ORCID0000-0001-7838-3409en_US
lrmi.learningResourceTypeInstructional Object - Lecture Materialen_US
lrmi.learningResourceTypeLearning Resource - Textbooken_US
lrmi.learningResourceTypeLearning Resource - Booken_US
ecO-OER.POD.compatibleNoen_US
dc.description.abstractTheory of Computing: An Open Introduction is a book suitable for courses on the theory of computing at both the undergraduate and graduate levels, and for self-study. Topics are introduced in a logical order: we begin with the simple finite automaton and progressively introduce stronger models of computation, up to the Turing machine. We then shift from the models themselves to what the models can compute, which opens up a discussion on computability and decidability. This leads us to a journey through complexity theory. The remainder of the book focuses on a selection of special topics.en_US
dc.subject.otherSciences - Mathematics & Statisticsen_US
dc.subject.otherTechnology - Computer Scienceen_US
ecO-OER.VLS.CategoryNoneen_US
ecO-OER.VLSNoen_US
ecO-OER.CVLPNoen_US
ecO-OER.ItemTypeLearning Resourceen_US
ecO-OER.ItemTypeLecture Materialen_US
ecO-OER.ItemTypeTextbooken_US
ecO-OER.MediaFormatPDFen_US
ecO-OER.MediaFormatExternal Siteen_US
ecO-OER.VLS.cvlpSupportedNoen_US
Appears in Collections:Ontario OER Collection

Files in This Item:
File Description SizeFormat 
theoryofcomputing.png%%c%%238.95 kBimage/pngView/Open
SmithTOCOpen.pdf%%dl%% Digital PDF1.97 MBPDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.