LANGUAGES AND MACHINES

NOTES FOR MATH237

Introduction and Table of Contents (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap00.pdf

Chapter 1: Logic (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap01.pdf

Chapter 2: Languages (updated 8^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap02.pdf

Chapter 3: Sets, Functions and Relations (updated 8^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap03.pdf

Chapter 4: Introduction to Finite-State Machines (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap04.pdf

Chapter 5: Equivalence and Reduction of Finite-State Machines (updated 8^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap05.pdf

Chapter 6: Non-Deterministic Finite-State Machines (updated 8^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap06.pdf

Chapter 7: Finite State Acceptors and Regular Languages (updated 8^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap07.pdf

Chapter 8: Turing Machines (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap08.pdf

Chapter 9: Extended Turing Machines (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap09.pdf

Chapter 10: The Busy Beaver Problem (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap10.pdf

Chapter 11: Integers mod m and Public Key Cryptography (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap11.pdf

Chapter 12: Polynomial Codes (updated 15^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/chap12.pdf

Appendices (updated 8^th July 2005)

http://www.ics.mq.edu.au/~chris/math237/appendix.pdf