7.1 Time Complexity
If a problem is decidable or solvable, does that mean you can
implement a solution using a real computer and get useful results?
not always, the solution may require too much time or memory
How do you determine if a problem can be so
CS 252 - Introduction to Computational Theory - Winter 2016
Due Thursday, January 14
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 1:
( 8 Points) Problem 2.4
( 6 Points) Problem 2.5
( 4 Points) Problem 2.14
( 4 Points) Pro
CS 252 - Introduction to Computational Theory - Winter 2016
Due Thursday, January 21
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 2:
( 8 Points) Problem 5.1
( 6 Points) Problem 5.3
( 3 Points) Problem 5.6
( 3 Points) Prob
CS 252 - Introduction to Computational Theory - Winter 2016
Due Tuesday, March 29
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 9:
( 6 Points) Problem 11.2 (should read . . . 3(|u| + 1) + 1)
(10 Points) Problem 11.3
( 6 Poi
CS 252 - Introduction to Computational Theory - Winter 2016
Due Thursday, February 4
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 4:
(12 Points) Problem A1. Construct a regular expression for the following FSA using
Algorith
CS 252 - Introduction to Computational Theory - Winter 2016
Due Tuesday, March 8
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 7:
(12 Points) Problem A1. Construct the F IRST2 , F OLLOW2 , and LA2 for each of the
variables in
CS 252 - Introduction to Computational Theory - Winter 2016
Due Thursday, January 28
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 3:
( 3 Points) Problem 5.28
( 3 Points) Problem 5.30
( 3 Points) Problem 5.33
(15 Points) P
CS 252 - Introduction to Computational Theory - Winter 2016
Due Tuesday, March 15
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 8:
(16 Points) Problem 8.5, all except (e)
( 7 Points) Problem 8.6
( 7 Points) Problem 8.11
(1
CS 252 - Introduction to Computational Theory - Winter 2016
Due Tuesday, March 1
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 6: For each problem listed below, exclude strong LL(k) for any k, if
applicable.
(10 Points) Probl
CS 252 - Introduction to Computational Theory - Winter 2016
Due Tuesday, February 23
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 5:
( 8 Points) Problem 7.1
( 8 Points) Problem 7.3 (a), (d), (h), and (j) only
( 6 Points) P
CS 252 - Introduction to Computational Theory - Winter 2016
Due Tuesday, April 5
By 1:35 p.m. for Section 1 and 3:00 p.m. for Section 2
Homework Assignment 10:
( 6 Points) Problem 12.1
( 7 Points) Problem 12.3
( 8 Points) Problem 12.13
( 9 Points) Pro