Scribd
Upload
71 views2 pages

Course Syllabus: CS 150: The Theory of Automata and Formal Languages Winter, 2011

This course introduces fundamental concepts in automata theory and formal languages including grammars, finite automata, regular expressions, formal languages, pushdown automata, and Turing machines. The course consists of two 80-minute lectures and a one-hour discussion session per week. Students will complete 5 homework assignments, 2 midterm exams, and a final exam that together will determine their grade. The textbook is Introduction to Automata Theory, Languages, and Computation by Hopcroft, Motwani, and Ullman.

Uploaded by

Taqi Shah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
71 views2 pages

Course Syllabus: CS 150: The Theory of Automata and Formal Languages Winter, 2011

This course introduces fundamental concepts in automata theory and formal languages including grammars, finite automata, regular expressions, formal languages, pushdown automata, and Turing machines. The course consists of two 80-minute lectures and a one-hour discussion session per week. Students will complete 5 homework assignments, 2 midterm exams, and a final exam that together will determine their grade. The textbook is Introduction to Automata Theory, Languages, and Computation by Hopcroft, Motwani, and Ullman.

Uploaded by

Taqi Shah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Syllabus: CS 150: The Theory of Automata and Formal Languages Winter, 2011

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. Course format: The course consists of two 80-minute lectures and a one-hour discussion session per week. The discussion session starts in the rst full week (i.e., Jan. 3) of the quarter. Each discussion session will be lead by a TA and will be used primarily to enforce concepts and techniques learned in class. Prerequisite: CS 14 and CS/MATH 111. The students are expected to have a strong background in the fundamentals of discrete mathematics (symbolic logic, set, induction, number theory, summation, series, combinatorics, graph, recursion, basic proof techniques, etc.), algorithms and data structures. Some knowledge of programming languages, programming, and computer architecture will be helpful. Instructor: Tao Jiang, EBU II 336, phone: 827-2991, email: [email protected]. Ofce Hours: TuTh 2-3pm. Teaching Assistants: All ofce hours are held in EBU II 110. Dis W 12:10 - 1pm ENGR2 143 Olga Tanaseichuk [email protected] Mon 1-2pm

Textbook: J. Hopcroft, R. Motwani, and J. Ullman. Introduction to Automata Theory, Languages, and Computation, 3rd edition, 2006, Addison-Wesley. Lecture Notes: Copies of transparencies used in lectures are available on the class homepage www.cs.ucr.edu/jiang/150-homepage.html in the PDF format. Reference Books (on reserve at the science library): (1) P. Linz. Introduction to Formal Languages and Automata, 3rd edition, 2000 (or 4th edition, 2006), Jones and Barlett; and (2) Michael Sipser, Introduction to the Theory of Computation, First Edition, 1997, PWS Publishing Company. Grading: 5 homework assignments (all paper and pencil) 25% Midterm test I (in class, 40 minutes, Feb. 3) 10% Midterm test II (in class, 80 minutes, March 1) 20% Final examination (March 14, 7 - 10pm) 45% Reading assignment: You are expected to review, before and after each class, the material to be covered in the class. A reference to the chapters of the text and major reference books that will be covered in lectures can be found in the tentative timetable below. Assignment Policy: 1. All assignments will be handed out in class and/or posted on the class homepage www.cs.ucr.edu/jiang/150-homepage.html 2. You have roughly one and half weeks for each homework assignment.

3. Submit your homework assignments to Prof. Jiang at least 5 minutes before the lecture on the due date begins. Make sure to put the assignment in the pile assigned to your discussion section, and always include your full name, ID, discussion section number, and the assignment number. 4. Write legibly. What cannot be read will not be graded. 5. No late assignments will be accepted. Academic dishonesty: Many students nd it helpful to consult their peers while doing assignments. This practice is legitimate and to be expected. However, it is not acceptable practice to pool thoughts and produce common answers. To avoid this situation, it is suggested that students not write anything down during such talks, but keep mental notes for later development of their own. Major occurrences of academic dishonesty, such as the submission of work that is not the students own, will be dealt with according to the UCRs and CSEs policies on academic dishonesty that can be found at webpage http://www.cs.ucr.edu/. Students who allow their les or assignments to be copied are as guilty of academic dishonesty as those who copy and will be treated accordingly. Each student is responsible for taking reasonable precautions to ensure that his/her work is not available for unauthorized use. Copying solutions from the Internet or books or any other public sources without explicit citations is prohibited! Table 1: Tentative Timetable Topic basic concepts of nite automata and languages deterministic nite automaton, nondeterminism equivalence between DFA and NFA regular expression and equivalence to FA algebraic laws for regular expressions pumping lemma and applications properties of regular languages minimization of automata and applications context-free grammars and languages midterm I on Feb. 3 parsing (or derivation) and parse trees ambiguity of a grammar and language pushdown automaton (PDA) various forms of PDA equivalence between CFG and PDA Chmosky normal form of CFG, pumping lemma midterm II on Mar. 1 properties of CFLs Turing machines and (un)decidability

Week of Jan. 3 Jan. 10 Jan. 17 Jan. 24 Jan. 31 Feb. 7

Chapters of [HMU] [Linz] 1,2 1,2 2,3 3 4 5 5 6 6 7 7 8 2,3 3 4,2 5 5 7 7 6,8 8 9

Feb. 14 Feb. 21 Feb. 28 Mar. 7

Legend: denotes the handing out of homeworks. Class Mailing List: Please subscribe to the class mailing through the class homepage ASAP and remember to conrm the subscription.

You might also like