CS150, "Introduction to Automata and Formal Languages"Spring 2016
Textbook: "An Introduction to Formal Languages and Automata", Peter Linz, third edition and above. Course Description: The course introduces some fundamental concepts in automata theory and formal languages including grammar, ?nite automaton, regular expression, formal language, pushdown automaton, and Turing machine. Not only do they form basic models of computation, they are also the foundation of many branches of computer science, e.g. compilers, software engineering, concurrent systems, etc. The properties of these models will be studied and various rigorous techniques for analyzing and comparing them will be discussed, by using both formalism and examples. Homework Assignments: Five homework assignments. The assignment should be turned in at the beginning of the lecture. No Late homework submittions will be accepted. Tests: Three tests test1 chapters 1-3, test2 chapters 4-7, test3 chatper 1-10 Final: Saturday, June 04, 03:00P.M. - 06:00P.M Attendance: Regular attendance at lectures and discussions is strongly advised. Students are also strongly encouraged to take advantage of the office hours. In case of a conflict with regular walk-in office hours, special appointments can be arranged. Students that are at risk of failing the class may be required to attend office hours. Grading: Tests 65%: test1 15%, test2 20%, test3 30% Homeworks 35%. Course grades are expected to be determined as follows: A+ -> 90+, A -> 85+ , A- -> 80+, B+ -> 77+, B -> 73+, B- -> 70+, C+ -> 67+, C -> 63+, C- -> 60+, D+ -> 57+, D -> 53+, D- -> 50+, F -> 49-.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||