CSE2303 Formal Methods I
Semester 1, 2005
Schedule

The following tentative schedule indicates when each lecture will be given.

Week	Starting Date	Tuesday	Thursday	Tute	Prac
1	February 28	Introduction	Regular Languages	-------	-------
2	March 7	Finite Automata	Transition Graphs	1	0
3	March 14	Converting Regular Expressions into Finite Automata	Lexical Analysis	1	1
4	March 21	Converting Finite Automata into Regular Expressions	Mealy and Moore Machines	-------	1
---	-----------------	Easter Break (Holiday)	--------------------------------------	-------	-------
5	April 4	Pumping Lemma for Regular Languages	Context Free Grammar	2	2
6	April 11	Context Free Grammar II	Parsers	2	2
7	April 18	Pushdown Automata and Chomsky Normal Form	Turing Machines	3	3
8	April 25	Computability	Universal Turing Machines	-------	-------
9	May 2	Non-computable languages	Propositional Logic	3	3
10	May 9	Predicate Logic	Prolog	4	4
11	May 16	Clauses	Resolution for Propositional Logic	4	4
12	May 23	Resolution for Predicate Logic	TBA	5	5
13	May 30	Revision	Revision	5	5

Schedule for Week 4 and Week 8

Due to Good Friday, there will be no tutorials on the week starting March 21st.

Due to Anzac Day, there will be no practical classes, or tutorials on the week starting April 25th.

Last modified 20/1/2005