From A-State Computer Science Wiki
< User:Jeffj‎ | CS4-5723
Revision as of 08:09, 22 August 2017 by Jeffj (Talk | contribs) (CS 4-5723 Automata Theory)

Jump to: navigation, search

CS 4-5723 Automata Theory

Fall 2017, Section 001, TR 9:30am-10:45am, HSS 1041 (3 credits)


Dr. Jeff Jenness
OfficeCSM 132Office HoursTR 11:00am-12:00pm and MW 11:00pm-12:00pm
Phone870-972-3978 ext.

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.

CS 4723 Program Objectives

  • Computer Science undergraduate students will attain an ability to apply knowledge of computing and mathematics appropriate to the discipline.
  • Computer Science undergraduate students will attain an ability to analyze problem and identify and define the computing requirements appropriate to its solution.
  • Computer Science undergraduate students will attain recognition of the need for and an ability to engage in continuing professional development.
  • Computer Science undergraduate students will attain an ability to use current techniques, skills, and tools necessary for computing practice.

CS 5723 Program Objectives

  • M.S. Computer Science graduate students should have a deeper understanding of the theory and application of algorithms, programming languages, and computer processes.

Course 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.

Course 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


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

Tests (3)70%


(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
11 Chapter 7
12 Chapter 8
13 Chapter 9
14 Chapter 10

Dates to Remember





Introduction to the Theory of Computation, 3rd ed. (ISBN: 978-1133187790), by Michael Sipser. Course Technology, 2012. (Amazon)


Go to the online repository

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