- Regular Languages
- Finite State Machines (FSM)
- Deterministic (DFSM)
- Nondeterministic (NDFSM)
- Regular Expressions
- Regular Grammars
- Minimizing DFSM
- Conversions between DFSM, NDFSM, Reg. Exp., and Reg. Grammars
- Proving regularity
- Closure properties
- Proving nonregularity
- Pumping theorem
- Using closure properties
- Decision Problems
- Membership, Emptiness, Totality, Finiteness, Equivalence, Minimality
- Context-free Languages
- Pushdown Automata (PDA)
- Context-free Grammars (CFG)
- Conversions
- PDA ↔ CFG
- CFG → Chomsky Bormal Form
- Ambiguity
- Proving context-freeness
- Closure properties
- Proving noncontext-freeness
- Pumping theorem
- Using closure properties
- Decision Problems
- Membership, Emptiness, Finiteness
- Undecidability
- Turing Machines (TM)
- Deterministic TM
- Decidable languages (D)
- Semidecidable languages (SD)
- Multi tape TM
- Nondeterministic TM
- Universal TM
- Halting Problem
- D and SD
- Enumeration
- Reduction
- Using reduction to prove undecidability
- Rice's Theorem
- Non-SD languages
- Unrestricted Grammars
- Non-TM Problems
- Post Correspondence Problem (PCP)
- Context-free language problems

Unless you have either the prerequisites for this course or written special permission from your Dean to enrol in it, you will be removed from this course and it will be deleted from your record.

This decision may not be appealed. You will receive no adjustment to your fees in the event that you are dropped from a course for failing to have the necessary prerequisites.

- Prof. Lucian Ilie, MC368, e-mail:
__ilie____uwo.ca__- Office hours: Wednesdays, 3:00 - 4:00pm, MC368

- Elaine Rich,
*Automata, Computability, and Complexity. Theory and Applications,*© Person Prentice Hall (2008), ISBN 978-0-13-228806-4. (errata)

- Jflap (You are allowed to use jflap for assignments.)

- Assignment 1 (10%) -- due Oct.17
- Assignment 2 (10%) -- due Oct.24
- Assignment 3 (10%) -- due Nov.30
- Assignment 4 (10%) -- due Dec.5
- Midterm Exam (30%) -- (covers Regular and Context-free Languages) --
**Tuesday, Oct. 31, in class (2 hours); see lecture notes for sample midterm**- Review sessions by TAs (in additions to in class):
- TBA

- Review sessions by TAs (in additions to in class):
- Final Exam (30%) -- (covers Turing Machines and Undecidability) -- TBA

- Tuesdays, 3:30 - 5:30pm, NCB-113
- Wednesdays, 9:30 - 10:30am, NS-7

- Yiwei Li (
__yli922____uwo.ca__) - Office hours: Thursdays, 4:30 - 6:30pm, MC4a
- Nick DelBen (
__ndelben____uwo.ca__) - Office hours: Thursdays, 10:30am - 12:30pm, MC4a
- Andy Yu (
__ayu82____uwo.ca__) - Office hours: Mondays, 4:30 - 6:30pm, MC4a

- The assignments will consist of a set of exercises related to the material covered in class. The solutions for the exercises should be neatly written or typed.
- All assignments will be made available on the course web site. The availability of assignments will be announced on class and/or via e-mail. Students are responsible for checking their e-mail on a regular basis.

- Appeals of assignment marks should be addressed to the T.A. first. If you and the T.A. cannot agree, then the T.A. will discuss the situation with the lecturer.
- Appeals must occur within 1 week from the first day that the marked assignments were made available to students. After that 1 week period has gone by, no more appeals will be considered.

A student requiring academic accommodation due to illness should use the Student Medical Certificate when visiting an off-campus medical facility or request a Record's Release Form (located in the Dean's Office) for visits to Student Health Services. The form can be found here: https://studentservices.uwo.ca/secure/medical_document.pdf

Students who are in emotional/mental distress should refer to Mental Health@Western http://www.uwo.ca/uwocom/mentalhealth/ for a complete list of options about how to obtain help.

Plagiarism: Students must write their essays and assignments in their own words. Whenever students take an idea, or a passage from another author, they must acknowledge their debt both by using quotation marks where appropriate and by proper referencing such as footnotes or citations. Plagiarism is a major academic offence.

If assignments are to be individual assignments: All assignments are individual assignments. You may discuss approaches to problems among yourselves; however, the actual details of the work (assignment coding, answers to concept questions, etc.) must be an individual effort.

The standard departmental penalty for assignments that are judged to be the result of academic dishonesty is, for the student's first offence, a mark of zero for the assignment, with an additional penalty equal to the weight of the assignment also being applied. You are responsible for reading and respecting the Computer Science Department's policy on Scholastic Offences and Rules of Ethical Conduct.

The University of Western Ontario uses software for plagiarism checking. Students may be required to submit their written work and programs in electronic form for plagiarism checking.