CSC240 Winter 2014 Homework Assignment 4
Due Monday, March 24
For this assignment, your proofs do not have to be formal (i.e. you dont have to write
separate lines with numbers and justifications on each line). However that does NOT mean that
your proofs

CSC240 Winter 2014 Homework Assignment 3
Due Monday, March 10
For this assignment, your proofs do not have to be formal (i.e. you dont have to write
separate lines with numbers and justifications on each line). However that does NOT mean that
your proofs

CSC240 Winter 2014 Homework Assignment 5
Due Friday, April 4
1. Let L be the language over alphabet cfw_a, b associated with the regular expression
r = ab aa + bba ab.
Find a nondeterministic finite automaton that is assosiated with L.
Hint: Theorem 3.1 f

CSC240 Winter 2014 Homework Assignment 1
due Wednesday January 22, 2014, 11:15am
1. Recall the rules of the game of chess. If you are not familiar with chess, then refer to
http:/en.wikipedia.org/wiki/Chess (particularly the Movement section) for the nece

CSC240 Winter 2014 Homework Assignment 2
For this assignment, your proofs do not have to be formal (i.e. you dont have to write
separate lines with numbers and justifications on each line). However that does NOT mean that
your proofs can omit important de