Difference between revisions of "User:Jeffj/CS4-5723/Syllabus"
From A-State Computer Science Wiki
< User:Jeffj | CS4-5723
Line 8: | Line 8: | ||
== Course Description == | == Course Description == | ||
− | {{:Courses/ | + | {{:Courses/CS 4-5723/Description}} |
=== Objectives === <!-- OPTIONAL --> | === Objectives === <!-- OPTIONAL --> | ||
− | {{:Courses/CS | + | {{:Courses/CS 4-5723/Objectives}} |
=== Outcomes === <!-- OPTIONAL --> | === Outcomes === <!-- OPTIONAL --> | ||
− | {{:Courses/CS | + | {{:Courses/CS 4-5723/Outcomes}} |
=== Grading === | === Grading === | ||
Line 74: | Line 74: | ||
==== Homework ==== <!-- OPTIONAL --> | ==== Homework ==== <!-- OPTIONAL --> | ||
− | |||
− | |||
== Materials == | == Materials == | ||
Line 90: | Line 88: | ||
=== Online Resources === <!-- OPTIONAL --> | === Online Resources === <!-- OPTIONAL --> | ||
− | :Go [[User: | + | :Go [[User:Jeff.jenness/CS4-5723/Supplements|here]] for course supplements. |
==== Software Downloads ==== <!-- OPTIONAL --> | ==== Software Downloads ==== <!-- OPTIONAL --> |
Revision as of 19:46, 29 August 2011
This page is undergoing initial construction or a major update. Please be advised that material that appears here may not be correct or current, and may change before the page is finalized. |
CS 4-5723 Automata Theory
Fall 2011, Section 001, TR 9:30am-10:45am, CSM 211 (3 credits)
Instructor
Dr. Jeff Jenness | |||
Office | CSM 132 | Office Hours | TR 11:00am-12:00pm and MW 11:00pm-12:00pm |
Phone | 870-972-3978 ext. 8117 | jeffj@astate.edu |
Course Description
- CS 4-5723. Automata Theory
- Study formal languages and equivalent models of computation, finite state automata and regular expressions, push down automata and context free grammars, pumping lemmas and closure properties, and turing machines. Prerequisites: CS 3113. Fall odd.
Objectives
The student will perform basic proofs in the foundations of computer science. The student will understand some of the theory behind regular languages and automata. The student will be able to construct grammars, automata and turing machines.
Outcomes
- Understand the basic principles behind mathematical induction
- Be able to construct basic proofs for sets and languages
- Understand the idea of deterministic and nondeterministic automata
- Construct simple machines and grammars for a variety of languages
- Prove properties for both regular and context-free languages
- Be able to construct turing machines for solving problems
Grading
Schedule
(subject to change)
Week | Topic | Reading | Assignment |
---|---|---|---|
1 | |||
2 | |||
3 | |||
4 | |||
5 | |||
6 | |||
7 | |||
8 | |||
9 | |||
10 | |||
11 | |||
12 | |||
13 | |||
14 | |||
15 |
Dates to Remember
Assignments
Homework
Materials
Textbook
Programming in the Infinite, 1st ed. (ISBN: 999-0000000000), by E. Ternal. Unbounded Publishing, 2010. (Amazon)
Online Resources
- Go here for course supplements.
Software Downloads
Infinity Compiler, Infinite Program Editor, (available for free download online at http://files.cs.astate.edu and elsewhere.)
Course Policies
See also: Department Policies
See Also
- Infinity en.wikipedia.org/wiki/Infinity Wikipedia article about infinity