| 1 | Due: ... | |||||
| .... | ||||||
| 2 | Due: ... | |||||
| .... | ||||||
| Endless streams of zeros and ones and what they tell us. The numbers show there must be uncomputable things, and we found one. (the halting problem) | ||||||
| Finite State Machines, regular languages and regular grammars. An FSM that recognises C++-style floating point constants. { "+" | "-" } ( d + "." d * | d * "." d + | d + ) { ( "e" | "E" ) { "+" | "-" } d + } The pumping lemma. Kleene operations. Regular languages are closed under Kleene operators, intersection, union, and complement. | ||||||
| Day Off | 19th | |||||
| Non-deterministic FSMs/grammars are often easier to design, but how can they work? | ||||||
| Break | 9th to 13th | |||||