Course Objectives: Students will study the oldest topic in computer science, theoretic computing machines, with the goal of determining what such machines can compute and what they cannot compute. They will learn about formal languages, automata, and complexity, noting their applications in a variety of areas, such as performance analysis, compiler design, and feasibility studies.

   Test   

• Test 1
• Test 1 - answers
• Topics for Test 2
• Review for Final

   Project   

• Project

   Misc   

• Answers to Opportunity 3
• Answer to Opportunity 5
• Answer to Opportunity 6
• Hints

   Abstract Machines Project    (in pdf format unless otherwise noted)

• Multi Stack Machine - Dan Bucatanschi and Pancham Gajjar
• Two Stack Machine - Dan Rinehimer and Derek Wilson
• Linear Bounded TM - Jack Zhao Jin
• Transforming FSA - Matthew St. John