|
David Scot Taylor 212 MacQuarrie Hall Assistant Professor Dept. of Computer Science San Jose State University Phone: (408) 924-5124 (email works better) Email: taylor "at" cs.sjsu.edu My office hours for Spring 2009 : Tue/Thur 8:20-9:00, (the last 10 minutes in MH222), 11:50-12:30, 14:45-15:30, or by appointment.I will also have office hours on Friday, 5/15, from 11 a.m. until noon. |
| Date | Topics Covered | Readings: skim before next class, read again afterwards. (Linz, Formal Languages and Automata, 4th Ed.) |
Homework |
| May 15 | Final Format Posted | Final Template Here | Note for Section 1: For problem 12.1.5, I made a mistake in my class discussion. The argument was okay, except in modifying the machine, I should have added links to a new (non-final) state which would self-loop on all symbols, rather than to the accept state. This alteration will change the machine so that the altered machine will halt on all input if and only if the original machine accepted all strings. |
| May 12 | Review | ||
| May 7 | Post's Correspondance Problem | ||
| May 5 | Undecidable Languages | For next time: 12.1-12.3 | Last written HW assignment (corrected 5/7), due 5/12: 12.1.5,
12.1.11 (kind of tricky, don't spend too long), 12.2.2, 12.3.1.
Please get your working programming assignments in soon. For program 1, all students now have working programs. If you had to resubmit, most who required resubmission lost 1 point out of 5. If you got no email, and didn't resubmit, you got 5/5. If you go online to my.sjsu.edu, under self service, you should have a link for online SOTE Ratings! |
| May 2 | Prog 2 graded. | You NEED to have the = and + part working. | 1st round of resubmissions by 5/5, with no hints given beyond whatever was in the email I sent you, and a small lateness penalty. 2nd round resubmissions after that, where I will tell you exactly what strings you failed on, with a larger penalty. |
| April 30 | TM Languages and Limits | For next time: 12.1-12.2 | No new written homework assigned, but DO THE READING (10.4,
11.1, 12.1-2.)
There will be another quiz on your 1st programming assignment on 5/5. The 2nd definition of "recursive" languages covered in class (the one with an enumeration procedure) was flawed as written. I will give alter that definition on Tuesday. |
| April 28 | Nondeterministic Turing Machines Universal Turing Machines |
For next time: 11.1 |
Due 5/5: 10.4.2, 10.4.5. There will be a quiz next class about the FIRST programming assignment. Please review it, considering the methods as partial boolean functions. (Boolean functions map each input to a true or false value. Partial functions map some inputs to true or false, but leave other inputs undefined.) |
| April 23 | Turing Machine Variants | 10.3, 10.4 | There is a minor change in grading for the 2nd part
of the 2nd programming assignment, given as a note near the bottom of
the assignment page.
No additional problems assigned. Do the readings well. |
| April 21 | Midterm 2 returned Turing Machines |
Read Chapter 9.3, 10.1, first 3 pages of 10.2 | Due 4/28: 9.1.4, 9.1.5 Due 5/1 morning: 2nd (and final) Programming Assignment. Work individually. |
| April 16 | Midterm 2 | Read Chapter 9.1. | There will be a quiz Tuesday on the reading. |
| April 14 | Midterm Review | ||
| April 9 | CFL pumping lemma and closure rules | Format for Midterm 2. | Due 4/14: 8.1.8 d+f with proof, 8.2.17, 8.2.18 |
| April 7 | Chomsky Normal Form and Closure Rules | Pages 205-208, 213-219. Please read before class 4/9, to help make the day's coverage of somewhat complex topics easier. |
Due 4/14: 6.2.4 (model answer on solution 6.2.5 in back of book) |
| April 2 | DPDAs and CFG: rule manipulation | 6.1, 6.2 | Due 4/9: 6.1.6, 6.1.7, 6.1.9 |
| March 19 | Context Free Grammars | Chapter 5 Note for Section 1 |
Due 4/7: 5.1.15, 5.2.11, 5.2.12 |
| March 17 | Context Free Grammars | Chapter 5 | Due 4/2: 5.1.7b, 5.1.7e, 5.1.8b, 5.1.13 Due 4/2: 1st Programming Assignment. Work individually. |
| March 12 | More NPDAs | Please note: The book's NPDA definition actually matches JFLAP's pretty well: they start with Z on the stack, and allow you to push multiple characters onto the stack at once. Read definitions 7.1 and 7.3 closely. | Due 3/19: Describe the differences between the NDPA definition we used in class (and JFLAP) and the one in the book. This goes beyond the Z start symbol. What is the biggest difference? Also, 7.3.2 (using the Linz definitions). Work in groups of no more than two. |
| March 10 | Midterm 1 returned | Chapter 7.1 | Due 3/17: 7.1.4 c,d,i,j, 7.1.6. You CAN work in groups of up to 3, but don't just divy up problems. |
| March 5 | Midterm 1 | ||
| March 3 | Review for Midterm 1 | ||
| February 26 | RL Pumping Lemma and Closure Rules | Tuesday is review, bring questions. | Format for Midterm 1. |
| February 24 | Non-Regular Languages and RL Pumping Lemma | Chapter 4.3, 4.1 (to p. 104), 4.2. | Due 3/3: 4.1.9, 4.2.7, 4.3.4f, 4.3.10b, 4.3.24 There will be no homework assigned between 2/26 and the midterm on 3/5. |
| February 19 | Regular Grammars | Chapter 4.3, 4.1 (to p. 104), 4.2. We will start with 4.3 next time. |
Due 2/26: 3.3.1, 3.3.2, 3.3.13. |
| February 17 | FA to RegExp | Chapter 3.3, 4.1 | Due 2/24: 3.2.10c. USE THE GIVEN PROCEDURE. Do this by hand, alone. |
| February 12 | Regexp definitions, meanings, and conversions to NFA | Chapter 3.2, 3.3 | Due 2/19: 3.1.1, 3.1.4, 3.2.4b: Give the NFA from
our procedure (not the DFA requested). Do these by hand.
Do this homework individually. |
| February 10 | DFA Minimization, "Big Picture" review, start regexp | Chapter 3.1 3.2 | Due 2/17: 2.4.1, 2.4.2b, 2.4.7. For this
homework, do machines by hand, though you may check your answers using
JFLAP.
You may do this homework in groups: ideally groups of 2, but a group of 3 is also accepted. |
| February 5 | NFAs and NFA/DFA Equivalence, Regular Language Closure under union, int, *, - |
Chapter 2.4 | Due 2/12: 2.3.3, 4.1.2b. 4.1.5, 4.1.8. For this
homework, do machines by hand. (Yes, Chapter 4 is correct. It uses
only material covered Feb 5 or earlier.)
You may do this homework in groups: ideally groups of 2, but a group of 3 is also accepted. |
| February 3 | DFAs, Unions, Intersections, and NonDeterminism (intro) | Chapter 2.2, 2.3 | Due 2/10: 2.1.11, 2.2.10, 2.2.12, 2.3.3. You may do this homework in groups: ideally groups of 2, but a group of 3 is also accepted. Your machines should be made using JFLAP. |
| January 29 | Languages, Grammars, and DFAs JFLAP machine from class (Download file, viewing it is not helpful.) |
Chapter 1.2, 2.1 | Due 2/5: 2.1.7e, 2.1.8a, 2.1.17, 2.2.11. You may do this homework in groups: ideally groups of 2, but a group of 3 is also accepted. Your machines should be made using JFLAP. |
| January 27 | Sets and Notation | 1.1, 1.2 | Due 2/3: 1.1.23, 1.1.32, 1.2.11, 1.2.16, 2.1.3,
2.1.5. You may do this homework with up to 2 other students. 2.1.5
should be done using JFLAP.
Bring laptops to next class! |
| January 22 | Introductions and Administrivia | Chapter 1.1 | Download JFLAP
software. Email me using subject: CS154Spring2009 In the email, include your email address, and which section you are in. Bring laptops to next class! |