|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)
|Dr. Jeff Jenness|
|Office||CSM 132||Office Hours||TR 11:00am-12:00pm and MW 11:00pm-12:00pm|
|Phone||870-972-3978 ext. email@example.com|
- 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.
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.
- 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:
Midterm 25% Final 25% Quizes (10) 50%
(subject to change)
Dates to Remember
Introduction to Automata Theory, Languages, and Computation, 3rd ed. (ISBN: 0-321-45536-3), by John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Pearson Education/Addison-Wesley, 2007. (Amazon)
- Go here for course supplements.
JFLAP is software for exploring and experimenting with automata, machines and grammars.
See Department Policies which will be adhered to within the course.
- Mathematical Induction en.wikipedia.org/wiki/Mathematical_induction Wikipedia article