Difference between revisions of "User:Jeffj/CS4-5723/Syllabus"

From A-State Computer Science Wiki
Jump to: navigation, search
Line 1: Line 1:
{{Underconstruction}} <!-- REMOVE AFTER SYLLABUS IS COMPLETE -->
+
<!-- {{Underconstruction}} <!-- REMOVE AFTER SYLLABUS IS COMPLETE -->
 
{{TOCright|limit=3}}
 
{{TOCright|limit=3}}
 
== CS 4-5723 Automata Theory ==
 
== CS 4-5723 Automata Theory ==
Line 21: Line 21:
  
 
=== Schedule === <!-- OPTIONAL -->
 
=== Schedule === <!-- OPTIONAL -->
<!--
 
 
''(subject to change)''
 
''(subject to change)''
 
<table border=0>
 
<table border=0>
Line 68: Line 67:
 
     <td valign=top>Chapter 8.1-4</td><td valign=top></td></tr>
 
     <td valign=top>Chapter 8.1-4</td><td valign=top></td></tr>
 
</table>
 
</table>
-->
 
  
 
==== Dates to Remember ==== <!-- OPTIONAL -->
 
==== Dates to Remember ==== <!-- OPTIONAL -->

Revision as of 13:28, 29 August 2013

CS 4-5723 Automata Theory

Fall 2011, Section 001, TR 9:30am-10:45am, CSM 211 (3 credits)

Instructor

Dr. Jeff Jenness
OfficeCSM 132Office HoursTR 11:00am-12:00pm and MW 11:00pm-12:00pm
Phone870-972-3978 ext. 8117Emailjeffj@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

Grades are assigned on a standard scale with the following weights:

Midterm25%
Final25%
Quizes/HW (10)50%

Schedule

(subject to change)

Week  TopicReadingAssignment
1 Chapter 1
2 Chapter 2.1-3
3 Chapter 2.4-5
4 Chapter 3.1-2
5 Chapter 3.3-4.1
6 Chapter 4.2-3
7 Chapter 4.4
8 Chapter 5.1-2
9 Chapter 5.3-4
10 Chapter 6.1-2
11 Chapter 6.3-4
12 Chapter 7.1-2
13 Chapter 7.3-4
14 Chapter 8.1-4

Dates to Remember

Assignments

Homework

Materials

Textbook

An Introduction to Formal Languages and Automata, 5th ed. (ISBN: 978-1-4496-1552-9), by Peter Linz. Jones & Bartlett Learning, 2012. (Amazon)

Online Resources

Go here for course supplements.

Software Downloads

JFLAP is software for exploring and experimenting with automata, machines and grammars.

Course Policies

See Department Policies which will be adhered to within the course.

See Also

create PDF version