DMTH237 Languages and Machines
This is a course on discrete
mathematics that discusses the mathematics behind computing science.
It includes chapters on logic,
set theory and strings and languages. There are some chapters on finite-state
machines, some chapters on Turing machines and computability, and a couple of
chapters on codes.
[Please note that
all links are to Adobe .pdf documents. They will open
in a separate browser window.]
- Introduction
and Table of Contents
- Chapter
1: Logic
- Chapter
2: Languages
- Chapter
3: Sets, Functions and Relations
- Chapter
4: Introduction to Finite-State Machines
- Chapter
5: Equivalence and Reduction of Finite-State Machines
- Chapter
6: Non-Deterministic Finite-State Machines
- Chapter 7:
Finite State Acceptors and Regular Languages
Chapter
8: Turing Machines - Chapter
9: Extended Turing Machines
- Chapter
10: The Busy Beaver Problem
- Chapter
11: Integers mod m and Public Key Cryptography
- Chapter
12: Polynomial Codes
- Appendices