Instructor: Sam Buss
Email:
sbuss@herbrand.ucsd.edu
Office: APM 6210
Phone: 534-6455
Office hours: M 9:00-9:50, Tu 11-12, W 1:00-1:50. (until Dec. 7)
Final exam week office hours:
M 2:30-4:00, Tu 3:30-5:00, W 1:00-2:00
Teaching Assistant: Rob Ellis.
rellis@math.ucsd.edu
Office: APM 2226
Office hours: Tu 3:30-4:30, W 4:30-5:30, and Th 2:30-3:30 (until Dec 9)
Final exam week office hours:
W 2:00-3:30, and Th 10:30-12:00.
Final Exam Review session: Tuesday, December 14, 7:00PM. Center Hall 109.
Soft reserves will have all homework and quiz answers as of Friday, December 10. A set of practice problems will be available in class on Monday, December 6, and solutions will be reviewed in the review session upon request, time permitting.
The textbook is Introduction to the Theory of Computation by M. Sipser.
This course will cover Automata and Regular and Context-free languages (Part I of the textbook), plus selected topics from Abstract Computability (Part II, Turing machines, etc.) and from Feasible Computability (Part III). These are basic topics in the foundations of the theory of computation, plus form the mathematical foundations for compiler design theory and for analysis of algorithmic efficiency.
The course will have a midterm exam on November 19 (date changed) and a final exam. There will be quizes in the Thursday section meetings on most weeks. Popquizes may be given in class: if you wish to prepare, go to last year's homepage and look at the old popquizes. Homework assignments will typically be due in class on Friday.
Course grading will be 50% final, 30% midterm, 10% homework, 10% quizes, 0% popquizes. You may drop your lowest two quiz scores. The percentages may change slightly, if so I will announce the change.
As an experiment, I have arranged for a bulletin board discussion group to be setup at discus.ucsd.edu.
Academic Integrity The course policy on academic integrity.
Homework #2, due Friday, October 15.
Pages 83-84: 1.1, 1.2, 1.3, 1.4a-f.
Homework #3, due Friday, October 22.
Homework #4, due Friday, October 29.
Homework #5, due Friday, November 5.
Homework #6, due Friday, November 12.
Homework #7, due Friday, December 3.
Homework #8, due Thursday, December 9.
Quiz answers will eventually show up in Soft Reserves.
Popquiz #1, Friday, October 1.
Quiz #1, Thursday, October 7.
Quiz #2, Thursday, October 14.
Quiz #3, Thursday, October 21.
Quiz #4, Thursday, October 28.
Quiz #5, Thursday, November 4.
Quiz #6, Thursday, November 11.
Quiz #7, Thursday, December 2.
Quiz #8, Thursday, December 9.
Pages 83-90: 1.4j,k,m,n, 1.5a,b,c,d, 1.6a, 1.7b, 1.8a, 1.9, 1.10b, 1.12,
1.24, 1.32a.
Continue reading the text as we cover the topics in class. (Note: 1.7a was
originally assigned instead of 1.7b. Please note the change!)
Pages 83-90: 1.14b,c, 1.15, 1.17, 1.18, 1.39, 1.41.
Continue reading the text as we cover the topics in class.
Pages 83-90: 1.16b.
Pages 120-122: 2.1, 2.3a-g,m, 2.4, 2.15.
Pages 83-90: 1.13a-g, 1.42*, 1.43*. [* = challenging!]
Pages 120-122: 2.5, 2.6a,b, 2.7a,b., 2.9.
Pages 121-122: 2.18a,c; 2.26*; 2.27*.
Pages 147-149: 3.6, 3.8a.
(A) Draw the state diagram of a Turing machine which recognizes
the language L containing all strings of the form ww^R where
w is from the alphabet {0,1} and w^R means the reversal of w.
(B) Draw the state diagram of a Turing machine such that when started
with input w, the Turing machine changes the tape contents to
w#w and halts in its accepting state.
From the textbook: 3.7, 4.7, 4.10, 4.11.
Quizes
Quizes will be posted in three formats: postsript, pdf and gif. Postscript
or pdf will give the best looking formating, but gif is more universally
available in web browsers. For postscript you will need the ghostview
program (or other postscript viewer) and
for pdf you will need Adobe Acrobat Reader. Gifs should work with
any web browser.
The popquiz covered set notation and logic. The results will be discussed
in class on Monday. The pop quiz is available in
postscript,
pdf and
gif formats.
Answers are also available in
postscript,
pdf and
gif formats, and are available
at Soft Reserves.
The first quiz will cover set notation and logic. To study:
read Chapter 0, review Monday's lecture, and look at the sample quizes:
pop quiz 1 above, plus a prior year's pop quiz with answers is also
available in
postscript,
pdf and
gif formats (and is available
in Soft Reserves too).
Quiz #1 is now available in
postscript,
pdf and
gif formats (answers are in Soft Reserves).
This quiz will cover DFA's. Best way to study: read through page 47
and do the homework assignments ahead of time.
The quiz is available in
postscript,
pdf and
gif formats (answers are in Soft Reserves).
This quiz will cover the construction of DFA's and NFA's.
The quiz is available in
postscript,
pdf and
gif formats (answers are in Soft Reserves).
This quiz will cover regular expressions and conversion of NFA's to DFA's.
The quiz (minus hand drawings) is available in
postscript,
pdf and
gif formats (answers are in Soft Reserves).
This quiz will cover the PUMPING LEMMA FOR REGULAR LANUAGES.
The quiz is available in
postscript,
pdf and
gif formats (answers are in Soft Reserves).
This quiz will cover the context free grammars and pushdown automata.
The quiz is available in
postscript,
pdf and
gif formats (answers are in Soft Reserves).
This quiz will cover the context free pumping lemma.
The quiz will be available in
postscript,
pdf and
gif formats (answers will be in Soft Reserves).
This quiz will cover Turing machines, especially state diagrams.
The quiz will be available in
postscript,
pdf and
gif formats (answers will be in Soft Reserves).
Course Handouts
UCSD Mathematics Department home
page
Author: Sam Buss, sbuss@ucsd.edu
