User Tools
courses:theory2014:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2014:main [2014/03/05 12:28] tsay [Announcements] |
courses:theory2014:main [2014/09/18 20:28] (current) tsay [Announcements] |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 06/28: grade report available; please send inquiries, if any, to the instructor by 2PM 06/30. | ||
| + | * 06/09: slides from TA sessions: {{courses:theory2014:tocta3.pptx|HW#5-7}}, {{courses:theory2014:tocta4.pptx|HW#8-10}}. | ||
| + | * 05/28: {{courses:theory2014:hw10.pdf|HW#10}} due on 06/04. | ||
| + | * 05/28: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 05/14: {{courses:theory2014:hw9.pdf|HW#9}} due on 05/21. | ||
| + | * 05/13: notes/slides for Reducibility available. | ||
| + | * 05/07: {{courses:theory2014:hw8.pdf|HW#8}} due on 05/14. | ||
| + | * 05/07: {{courses:theory2014:theory2014mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 04/30: notes/slides for Decidability and Undecidability available. | ||
| + | * 04/23: {{courses:theory2014:hw7.pdf|HW#7}} due on 04/30. | ||
| + | * 04/23: notes/slides for Turing Machines available. | ||
| + | * 04/09: slides from TA sessions: {{courses:theory2014:tocta1.pptx|HW#1-2}}, {{courses:theory2014:tocta2.pptx|HW#3-4}}. | ||
| + | * 04/08: old exams: {{courses:theory:old_exams.zip|2000-2013}}. | ||
| + | * 04/08: {{courses:theory2014:hw6.pdf|HW#6}} due on 04/23. | ||
| + | * 04/08: {{courses:theory2014:hw5.pdf|HW#5}} due on 04/16. | ||
| + | * 03/31: {{courses:theory2014:hw4.pdf|HW#4}} due on 04/09. | ||
| + | * 03/25: notes/slides for Context-Free Languages and Pushdown Automata available. | ||
| + | * 03/20: {{courses:theory2014:hw3.pdf|HW#3}} due on 03/26. | ||
| + | * 03/10: due date of HW#2 postponed till 3/14. | ||
| * 03/05: notes/slides for Finite Automata and Regular Languages available. | * 03/05: notes/slides for Finite Automata and Regular Languages available. | ||
| * 03/03: {{courses:theory2014:hw2.pdf|HW#2}} due on 03/12. | * 03/03: {{courses:theory2014:hw2.pdf|HW#2}} due on 03/12. | ||
| Line 53: | Line 72: | ||
| *MIT OpenCourseWare: [[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-045j-automata-computability-and-complexity-spring-2011/index.htm|Automata, Computability, and Complexity]] | *MIT OpenCourseWare: [[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-045j-automata-computability-and-complexity-spring-2011/index.htm|Automata, Computability, and Complexity]] | ||
| *Stanford Coursera: [[https://www.coursera.org/course/automata|Automata]] | *Stanford Coursera: [[https://www.coursera.org/course/automata|Automata]] | ||
| - | * [[http://dl.acm.org/citation.cfm?id=2093549&CFID=70582427&CFTOKEN=84470362|What is an Algorithm?]] (M.Y. Vardi, Communications of the ACM, Volume 55 Issue 3, March 2012) | ||
| *//[[http://www.amazon.com/Introduction-Automata-Languages-Computation-Addison-Wesley/dp/020102988X/ref=sr_1_11?s=books&ie=UTF8&qid=1361114620&sr=1-11&keywords=Introduction+to+Automata+Theory%2C+Languages%2C+and+Computation|Introduction to Automata Theory, Languages, and Computation]]//, John E. Hopcroft and Jeffrey D. Ullman, Addison-Wesley, 1979. | *//[[http://www.amazon.com/Introduction-Automata-Languages-Computation-Addison-Wesley/dp/020102988X/ref=sr_1_11?s=books&ie=UTF8&qid=1361114620&sr=1-11&keywords=Introduction+to+Automata+Theory%2C+Languages%2C+and+Computation|Introduction to Automata Theory, Languages, and Computation]]//, John E. Hopcroft and Jeffrey D. Ullman, Addison-Wesley, 1979. | ||
| *//[[http://www.amazon.com/Introduction-Automata-Theory-Languages-Computation/dp/0321455371/ref=sr_1_2?s=books&ie=UTF8&qid=1361114620&sr=1-2&keywords=Introduction+to+Automata+Theory%2C+Languages%2C+and+Computation|Introduction to Automata Theory, Languages, and Computation, 3rd Edition]]//, John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman, Addison-Wesley, 2006. | *//[[http://www.amazon.com/Introduction-Automata-Theory-Languages-Computation/dp/0321455371/ref=sr_1_2?s=books&ie=UTF8&qid=1361114620&sr=1-2&keywords=Introduction+to+Automata+Theory%2C+Languages%2C+and+Computation|Introduction to Automata Theory, Languages, and Computation, 3rd Edition]]//, John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman, Addison-Wesley, 2006. | ||
| *//[[http://www.amazon.com/Elements-Theory-Computation-2nd-Edition/dp/0132624788|Elements of the Theory of Computation, 2nd Edition]]//, Harry R. Lewis and Christos H. Papadimitriou, Prentice-Hall, 1998. | *//[[http://www.amazon.com/Elements-Theory-Computation-2nd-Edition/dp/0132624788|Elements of the Theory of Computation, 2nd Edition]]//, Harry R. Lewis and Christos H. Papadimitriou, Prentice-Hall, 1998. | ||
| *[[http://www.fi.edu/learn/sci-tech/automaton/automaton.php?cts=instrumentation|Maillardet's Automaton]] at the Franklin Institute. | *[[http://www.fi.edu/learn/sci-tech/automaton/automaton.php?cts=instrumentation|Maillardet's Automaton]] at the Franklin Institute. | ||
| + | *[[http://dl.acm.org/citation.cfm?id=2093549&CFID=70582427&CFTOKEN=84470362|What Is an Algorithm?]] (M.Y. Vardi, Communications of the ACM, Volume 55 Issue 3, March 2012) | ||
| + | *[[http://www.youtube.com/watch?v=BDPHfRuAFnU|What Is Computation?]] (a lecture by Leslie Lamport, who received the 2013 Turing Award) | ||
| *Free Tool: [[http://goal.im.ntu.edu.tw/|GOAL]] | *Free Tool: [[http://goal.im.ntu.edu.tw/|GOAL]] | ||
| *Free Tool: [[http://www.jflap.org/|JFLAP]] | *Free Tool: [[http://www.jflap.org/|JFLAP]] | ||
courses/theory2014/main.1393993697.txt.gz ยท Last modified: 2014/03/05 12:28 by tsay
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
