COMP 2805 Solutions Assignment 1
Question 1: For each of the following languages, construct a DFA that accepts the language.
In all cases, the alphabet is cfw_0, 1.
(1.1) cfw_w : w begins with 00 and contains exactly one 1.
(1.2) cfw_w : w begins with 00
CARLETON UNIVERSITY
SCHOOL OF COMPUTER SCIENCE
FALL 2010
COMP. 2805 - DISCRETE STRUCTURES: II
ASSIGNMENT IV
DUE: DECEMBER 3, 2010
_
Assignment Policy: Late assignments will not be accepted. You are expected to work on the assignments on your
own. Past exp
CARLETON UNIVERSITY
SCHOOL OF COMPUTER SCIENCE
FALL 2010
COMP. 2805 - DISCRETE STRUCTURES: II
ASSIGNMENT III
DUE: MONDAY, NOV. 15, 2010 (9:00 AM)
_
Assignment Policy: Late assignments will not be accepted. You are expected to work on the assignments
on yo
CARLETON UNIVERSITY
SCHOOL OF COMPUTER SCIENCE
FALL 2010
COMP. 2805 - DISCRETE STRUCTURES: II
ASSIGNMENT II
DUE: FRIDAY, OCT. 15, 2010 (4:00 PM)
_
Assignment Policy: Late assignments will not be accepted. You are expected to work on the assignments
on you
CARLETON UNIVERSITY
SCHOOL OF COMPUTER SCIENCE
FALL 2010
COMP. 2805 - DISCRETE STRUCTURES : II
ASSIGNMENT I
DUE: FRIDAY, OCT. 1, 2010 (4:00 PM)
_
Assignment Policy: Late assignments will not be accepted. You are expected to work on the assignments
on your
COMP 2805 Assignment 3
Due: November 17, before 23:59 pm, in the course drop box in Herzberg 3115.
Assignment Policy: Late assignments will not be accepted. Students are encouraged to
collaborate on assignments, but at the level of discussion only. When w
COMP 2805 Solutions Assignment 2
Question 1: Give regular expressions describing the following languages. In all cases, the
alphabet is cfw_0, 1.
cfw_w : w contains an odd number of 1s or exactly two 0s.
Solution:
0 (10 10 ) 10 1 01 01
cfw_w : w contain
COMP 2805 Assignment 1
Due: October 6, before 23:59 pm, in the course drop box in Herzberg 3115.
Assignment Policy: Late assignments will not be accepted. Students are encouraged to
collaborate on assignments, but at the level of discussion only. When wri
C q 9cfw_ iq RX R P f X nhX PH F 5 B 7 2 "repygrg q '[email protected] B thd gePiXgcR beP R d gAxrypbmgfd h R h d s cfw_ R X P d P X R P ggX(icP qR rXcfw_ p P d Pcfw_ (PcghndwX t r x P Rcfw_ R exCgx r6p tF fB rned7 c2n gh 8 r3R gyd7 ib [email protected] iX ePbrvl rEx q 9c
Lecture Notes Introduction to Theory of Computation (COMP 2805)
Anil Maheshwari Michiel Smid
School of Computer Science Carleton University E-mail: cfw_anil,[email protected]
April 1, 2010
ii
Contents
Preface 1 Introduction 1.1 Purpose and motivatio
SETS
Set = A collection of objects E = cfw_0, 2, 4, P = cfw_2, 3, 5, 7, A = cfw_A, B, C, D, . . ., Z Two sets are same if their elements are the same. A = cfw_1,2,3 B = cfw_2,1,3
A B: If each element of A is in B. A B: if A B and A B. A B, A B, A B.
SOME