Course:

Spring 2007
CS 547


Registrar Info:

Instructor: Ronald Prescott Loui    
Class: SP2007 E81 CSE 547T 01: Introduction to Formal Languages and Automata 
Location: Cupples II 200 -T-R--- 2:30PM 4:00PM
 
Session: REG Start: 01/16/2007  End: 05/18/2007  


TA:  XueFeng Zhou (xzhou--aat-cs.wustl.edu)

Description:

CSE 547T.  Introduction to Formal Languages and Automata 

(Formerly: CS 507T.  Introduction to Formal Languages and Automata) An
introduction to the mathematical theory of languages and grammars. Topics
include deterministic and nondeterministic finite state machines,
push-down automata, and Turing machines; regular, context-free,
context-sensitive and recursive languages; closure properties of
languages; the concepts of computability and undecidability.
Prerequisite: CSE 201.  Credits: 3 unit.


Texts:

Martin.  Introduction to Languages and the Theory of Computation.  

http://books.google.com/books?id=7GEO95WGhg4C&dq=martin+theory+of+computation&pg=PP1&ots=tDhLdjtaWB&sig=d8QqvMwBBdId0EI_hfvid_ovvI4&prev=http://www.google.com/search%3Fsourceid%3Dnavclient%26ie%3DUTF-8%26rls%3DGGLG,GGLG:2006-51,GGLG:en%26q%3Dmartin%2Btheory%2Bof%2Bcomputation&sa=X&oi=print&ct=result&cd=1

An older edition such as

http://product.half.ebay.com/Introduction-to-Languages-and-the-Theory-of-Computation_W0QQtgZinfoQQprZ37807

is fine, as this is the copy that I have.


Student Evaluation:

One final exam (25%), one midterm (50%), and five graded problems
(5% each).


Format:

Twice weekly lecture.  When instructor is out of town, students
will be given an assignment (possibly a make-up assignment).

Concepts:

Motivation.
Naive regular expressions.
Intuitionistic (constructivist) mathematics.
Set axioms, string axioms, and the natural numbers.
Metamathematical notation.
Formal Specification.
Strings and operations on strings.
Sets and Countability.
Languages and Alphabets.
Regular Expressions.
Finite State Machines.
Minimality and Equivalence Classes.
Nondeterminism.
Pumping Lemma.
Counter Machines.
Push-Down Machines.
Grammars.
Turing Machines.
k-Tape Reduction.
2-way Reduction.
Nondeterminism Reduction.
Halting.
Decidability and Undecidability.
Separation of SA and NSA.
Existence of a Non-r.e. Language.
Primitive Recursive Functions (probably).
Decidable Classes of Predicate Logic (possibly).


Calendar:  

   January 2007
 S  M Tu  W Th  F  S
14 15 16 17 18 19 20
      FIRST CLASS
21 22 23 24 25 26 27
28 29 30 31  1  2  3

   February 2007
 S  M Tu  W Th  F  S
 4  5  6  7  8  9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
            INSTRUCTOR OUT OF TOWN
25 26 27 28   1  2  3

   March 2007
 S  M Tu  W Th  F  S
 4  5  6  7  8  9 10
11 12 13 14 15 16 17
      SPRING BREAK
            SPRING BREAK
18 19 20 21 22 23 24
25 26 27 28 29 30 31

   April 2007
 S  M Tu  W Th  F  S
 1  2  3  4  5  6  7
 8  9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
    LAST CLASS

   May 2007
 S  M Tu  W Th  F  S
29 30  1  2  3  4  5
	     EXAMS BEGIN
 6  7  8  9 10 11 12
	  EXAMS END