Automata Theory: CSCI549-001
Automata Theory: CSCI549-001
Automata Theory: CSCI549-001
CSCI549-001
AUTOMATA THEORY
Spring, 2013
Department of Computer Science
College of Arts and Sciences
Instructor:
Dr. S. Suh, Professor & Head, Department of Computer Science
Texas A&M University - Commerce
Office: Jour 123; Phone: 903.468.8199; E-mail: sang.suh@tamuc.edu
Textbook:
Introduction to Computer Theory by Daniel I. A. Cohen
John Wiley & Sons, Inc., 1997, 2nd Ed. ISBN 0-471-13772-3
Textbook Organization:
PART I: Chapters 1,2,3,4,5,6,7,8,9,10 and 11
PART II: Chapters 12,13,14,15,16 and 17
PART III: Chapters 19 and 20
Course Objectives:
This course is one of the five core courses for M.S. degree in Computer Science at Texas A&M
University - Commerce. The primary goal of this course is to provide fundamental introduction to
the design of programming languages (PL). Both the theoretical foundations of PL and its
practical aspect will be studied by covering chapters 1 through 20. The fundamental topics to be
covered in this course include regular expressions, finite automata, (non-)regular languages,
context-free grammars, regular grammars, Chomsky normal forms, pushdown automata, (non-
)context-free languages, parsing and Turing machines. These fundamentals are essential
prerequisite for those who may pursue more advanced topics and applications of Computer
Science. Since the ultimate goal of automata theory is the construction of efficient program
languages, no study of automata is complete without some experience designing grammars. For
this purpose, a medium-scale program language design project will be assigned as a class
project. The design project is an essential part of the successful course completion. The grading
will be based on the following criteria:
Academic Ethics:
"All students enrolled at the University shall follow the tenets of common decency and
acceptable behavior conducive to a positive learning environment." (See Student's Guide
Handbook, Policies and Procedures, Conduct).
Attendance Policy:
Students are expected to be present at all class lectures. If a student is absent from class
on the due date of any assignment, they are expected to make alternative arrangements to
assure that the assignment is turned in ON TIME. Any student wishing to withdraw from the
course must do so officially as outlined in the class schedule. THE INSTRUCTOR
CANNOT DROP OR WITHDRAW ANY STUDENT.
Course Outline:
9 LR(1) Parser
-Parser Project