|
CSE 322, Au '10: Introduction to Formal Models in Computer Science |
|
 CSE Home |
About Us |
Search |
Contact Info |
|
|
Course Email: cse322a_au10@uw.edu. Use this list to ask and/or answer questions about homework, lectures, etc. The instructor is subscribed to this list. All messages are automatically archived. Questions not of general interest may be directed to the instructor and/or TAs collectively (via the "course staff" link at left) or separately (via email addresses above). You can (probably should) change your subscription options. Catalog Description: Finite automata and regular expressions; context-free grammars and pushdown automata; nondeterminism; Turing machines and the halting problem. Emphasis on understanding models and their applications and on rigorous use of basic techniques of analysis. Induction proofs, simulation, diagonalization, and reduction arguments. Prerequisite: CSE 321 Credits: 3 Learning Objectives: The main goal of the course is to give students an ability to develop and rigorously reason about abstract formal models of computational devices, and an appreciation for the powers and limitations of such formalisms. An important secondary goal is to teach a body of facts about and techniques for studying ``classical'' models, such as finite automata and context-free grammars, having important applications in a variety of other areas of computer science, e.g., compilers and program specification. Grading: Homework, Midterm, Final. Homework may include some programing. Overall weights 55%, 15%, 30%, roughly. Late Policy: Unless otherwise announced, papers and/or electronic turnins are due at the start of class on the due date. 10% off for up to one day late (business day, e.g., Monday for Friday due dates); additional 20% per day thereafter. Extra Credit: Assignments may include "extra credit" sections. These will enrich your understanding of the material, but at a low points per hour ratio. Do them for the glory, not the points, and don't start extra credit until the basics are complete. Collaboration: Homeworks are all individual, not group, exercises. Discussing them with others is fine, even encouraged, but you must produce your own homework solutions. Follow the "Gilligan's Island Rule": if you discuss the assignment with someone else, don't keep any notes (paper or electronic) from the discussion, then go watch 30+ minutes of TV (Gilligan's Island reruns especially recommended) before you continue work on the homework by yourself. You may not look at other people's written solutions to these problems, not in your friends' notes, not in the dorm files, not on the internet, ever. If in any doubt about whether your activities cross allowable boundaries, tell us before, not after, you turn in your assignment. See also the UW CSE Academic Misconduct Policy, and the links there. Textbook: Michael Sipser, Intro. to the Theory of Computation, 2nd ed., Thompson Course Technology, 2005. Errata. (Available from U Book Store, Amazon, etc.) Portions of the CSE 322 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 322 Web: © 1993-2010, Department of Computer Science and Engineering, University of Washington. |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |
cs