DSpace Repository

Theory of computing : An open introduction

Show simple item record

dc.contributor.author Smith, Taylor
dc.date.accessioned 2025-11-21T19:04:11Z
dc.date.available 2025-11-21T19:04:11Z
dc.date.issued 2024-09
dc.identifier 4bad5bea-0316-4a19-a018-213d62064940
dc.identifier.uri https://openlibrary-repo.ecampusontario.ca/jspui/handle/123456789/2460
dc.description.tableofcontents I. Regular Languages en_US
dc.description.tableofcontents II. Context-Free Languages en_US
dc.description.tableofcontents III. Decidable and Semidecidable Languages en_US
dc.description.tableofcontents IV. Decision Problems en_US
dc.description.tableofcontents V. Proving Undecidability en_US
dc.language.iso eng en_US
dc.relation.isformatof https://people.stfx.ca/tjsmith/pub/tocopen/ en_US
dc.relation.haspart Resources for Educators: Source Files | https://github.com/taylorjsmith/tocopen en_US
dc.rights CC BY-SA | https://creativecommons.org/licenses/by-sa/4.0/ en_US
dc.title Theory of computing : An open introduction en_US
dc.type Learning Object en_US
dcterms.accessRights Open Access en_US
dcterms.educationLevel University - Undergraduate en_US
dcterms.educationLevel University - Graduate & Post-Graduate en_US
dc.identifier.slug https://openlibrary.ecampusontario.ca/catalogue/item/?id=4bad5bea-0316-4a19-a018-213d62064940
ecO-OER.Adopted No en_US
ecO-OER.AncillaryMaterial Yes en_US
ecO-OER.InstitutionalAffiliation St. Francis Xavier University en_US
ecO-OER.ISNI 0000 0004 1936 7363 en_US
ecO-OER.Reviewed No en_US
ecO-OER.AccessibilityStatement No en_US
ecO-OER.ORCID 0000-0001-7838-3409 en_US
lrmi.learningResourceType Instructional Object - Lecture Material en_US
lrmi.learningResourceType Learning Resource - Textbook en_US
lrmi.learningResourceType Learning Resource - Book en_US
ecO-OER.POD.compatible No en_US
dc.description.abstract Theory 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.other Sciences - Mathematics & Statistics en_US
dc.subject.other Technology - Computer Science en_US
ecO-OER.VLS.Category None en_US
ecO-OER.VLS No en_US
ecO-OER.CVLP No en_US
ecO-OER.ItemType Learning Resource en_US
ecO-OER.ItemType Lecture Material en_US
ecO-OER.ItemType Textbook en_US
ecO-OER.MediaFormat PDF en_US
ecO-OER.MediaFormat External Site en_US
ecO-OER.VLS.cvlpSupported No en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account