Welcome to COMP 330 Fall 2013
Theory of Computation
Instructor : Prakash Panangaden
August 26, 2013
Welcome to COMP 330. This is the principal undergraduate course in theoretical computer science
at the School of Computer Science (SOCS). In this course we
Sample Cover Page
December 2011
Final Examination
VERSION # (Only required for multiple choice exams)
FACULTY OF SCIENCE
FINALCOURSE TITLE
EXAMINATION
COURSE NUMBER & SECTION
DATE & TIME OF EXAM
Examiner:
Assoc Examiner:
COMPUTER SCIENCE COMP 330
Theoreti
308330A
School of Computer Science
Final Examination
Examiner: Prof. D. Thérien Monday, December 5, 2005
Associate Examiner: Prof. N. Friedman 14:00 17:00
Instructions:
Answer in the examination booklets provided.
N 0 notes or texts allowed.
Calculat
The Principle of Well-Founded Induction
COMP 330 Autumn 2013 McGill University
Prakash Panangaden
In this note I will prove the principle of induction for general well-founded orders. I
assume that all of you are familiar with logical reasoning involving
Chapter 1, Part 2
Nondeterministic Finite Automata
CSC527, Chapter 1, Part 2 c 2012 Mitsunori Ogihara
1
Fundamental set operations
Let A and B be two languages. In addition to union and
intersection, we consider the following set operations:
Concatenatio
The Myhill-Nerode Theorem
Prakash Panangaden
22nd September 2013
The collection of strings over an alphabet , i.e. is an innite set1 with a binary operation
called concatenation and written by placing the arguments next to each other as in xy ; occasional
Notes on Labelled Transition Systems and
Bisimulation
Prakash Panangaden
September 26, 2013
1
Introduction
We are interested in modelling systems and studying their behaviour. In
particular, we would like to know when two systems have the same behaviour.