CS375

Online Course Syllabus CS375 Computation Theory

Important Notes: This document provides an overview of expectations for this online course and is subject to change prior to the term start. Changes may also occur during the term due to faculty or SPS Distance Learning course updates. Some links may only be active once the term starts. For this course you must check the Regis Bookstore: http://www.efollett.com for the most current online course material information.

Course Description | Prerequisites Course Outcomes | Course Materials | Grading Criteria| Assignments

Course Description CS 375: COMPUTATION THEORY (3). This course provides the concepts of languages and languages analysis, including lexical analysis, syntax analysis, and regular expressions. It introduces automata theory including deterministic and non-deterministic finite state machines and parsing techniques. Top

Course Prerequisites Take MT 320 and either CS 341 or CS 362 Top

Course Outcomes Successful completion of this course will enable students to do the following:

file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (1 of 9)1/29/2007 3:23:05 PM

CS375 ●

Explain the concept of language as used in theoretical computer science.



Use regular expressions to represent languages.



Use regular expressions as a template for the creation of strings.



Create and use finite state automata.



Describe how nondeterminism is used to facilitate automata construction.



State and explain Kleene’s theorem.



Describe the similarities and difference between finite state automata, pushdown stack automata and Turing machines.



Create and use pushdown stack automata.



Create and use Turing machines.



Define context free grammars.



Use the total language tree representation of a context free grammar to generate strings in the language expressed by the grammar.



Explain the Church Turing hypothesis.

Top

Course Materials Required Text Cohen, Daniel. (1997). Introduction to Computer Theory, 2nd Edition. New York, NY: John Wiley & Sons, Inc. ISBN: 0-471-13772-3. Top file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (2 of 9)1/29/2007 3:23:05 PM

CS375

Grading Criteria Weekly Forum Activities & Participation:

10%

Weekly Assignments:

50%

Midterm Exam:

20%

Final Exam:

20%

Grading Scale

90-100

80-89

A

Demonstrate the ability to use the language and automata formalisms very accurately. Demonstrate the ability to apply the conceptual framework of computation theory.

B

Demonstrate the ability to use the language and automata formalisms accurately. Demonstrate the ability to apply some of the conceptual framework of computation theory.

70-79

C

60-69

D

59 or lower

F

Demonstrate the ability to use some of the language and automata formalisms accurately. Demonstrate the ability to comprehend some of the theoretical course material.

Demonstrate some familiarity with the course material.

Top

Online Course Assignments CS375 Week 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8

Course Dynamics This course is organized around an eight-week program. Weekly outcomes, assignments, and critical information are organized week-byweek. Typically, each week includes a reading assignment, forum submittal, e-mail assignment, and work on your final course project. Work on your final project every week and make periodic submittals of your progress as required by your Facilitator. file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (3 of 9)1/29/2007 3:23:05 PM

CS375

Online weeks correlate to a 7-day work week. Each week's work begins on a Sunday. Week One begins on the first day of the session, which is always a Monday. Prior to the start of each week, before Sunday, complete the reading assignments. On Sunday of each week, read your weekly critical information found in the Week-by-Week section. (Note: Your timely understanding of critical information content may be required to complete your weekly assignment or final project.) Generally, by Wednesday of each week, participate in the Forum discussions, read other student postings, and reply, when appropriate, to their postings. Generally, by Friday of each week, save a copy of your assignments for yourself and e-mail them to your Facilitator. Exams will be open the entire week given, and three hours in length.

Week 1: Introduction to the Theory of Computation Reading:





Read Chapters 1, 2, and 3 of Introduction to Computer Theory Week by Week material

Forum:



Introduction



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday.

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 1.

file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (4 of 9)1/29/2007 3:23:05 PM

CS375

Top

Week 2: Regular Expressions and Finite Automata Reading:



Read Chapters 4 and 5 of Introduction to Computer Theory



Week by Week material

Forum:



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 2.

Top

Week 3: Nondeterministic Finite Automata Reading:





Read Chapter 6 and pp. 135 – 140 of Introduction to Computer Theory Week by Week material

Forum:



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday.

file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (5 of 9)1/29/2007 3:23:05 PM

CS375

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 3.

Top

Week 4: Kleene's Theroem Reading:





Read Chapter 7, pp. 92 – 142 of Introduction to Computer Theory Week by Week material

Forum:



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday.

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 4.

Exam:



Take the Mid-term exam.

Top

Week 5: Regular Languages and Decidability file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (6 of 9)1/29/2007 3:23:05 PM

CS375

Reading:





Read Chapter 9, pp. 169 – 185.11, and Chapter pp 207 – 217 of Introduction to Computer Theory Week by Week material

Forum:



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday.

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 5.

Top

Week 6: Nonregular Languages and Context Free Grammar Reading:





Read Pumping Lemma section of Chapter 10, pp. 187 – 196, Chapter 12, pp 224 – 254, Regular Grammars section of Chapter 13, pp. 259 – 265 of Introduction to Computer Theory Week by Week material

Forum:



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday.

file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (7 of 9)1/29/2007 3:23:05 PM

CS375

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 6.

Top

Week 7: Push Down Stack Automata Reading:





Read Chapter 14, pp. 289 – 312 of Introduction to Computer Theory Week by Week material

Forum:



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday.

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 1.

Top

Week 8: Turing Machines Reading:



Read Chapter 19, pp. 434 – 453, “Church’s Thesis” pp. 610 – 612 of Introduction to Computer Theory

file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (8 of 9)1/29/2007 3:23:05 PM

CS375 ●

Week by Week material

Forum:



Discussion Questions (see Weekly Activities pages) Post initial responses by Wednesday, follow up and respond to at least two other students by Saturday.

Assignment:



Problems (see Weekly Activities pages) Submit to your facilitator by no later than midnight Sunday of Week 1.

Final Exam: Take the final exam. Complete the online course evaluation form located at the bottom of the content in the Week by Week. Top

Please contact [email protected] if you need assistance or to report any problems.© 2006 Regis University. All Rights Reserved.

file:///K|/SpsDL/a_webct_to_angel/Undergrad/Clean/CS375_Dave/CS375.htm (9 of 9)1/29/2007 3:23:05 PM