Navigation auf uzh.ch
Navigation auf uzh.ch
| Module: | BINF2100 |
| Type: | Lecture with Exercises |
| ECTS: | 6 points |
| Lecture: | Friday, 08:30-12:00 |
| Venue: | BIN 2.A.01 |
| Lecturers: | Prof. Rolf Pfeifer, Dr. Rudolf Füchslin |
| Target audience: | BSc/3+ |
| Precondition: | Assessment RO 2004 passed, at least provisional |
| Language: | English |
| Assessment: | Exercises & written exam. Exam date: Friday, 10.01.2014, 8:00 - 10:00 |
| Assistants: | Qian Zhao, Konstantinos Dermitzakis, Tobias Klauser |
| Date | Topic | Hand out | Hand in |
|---|---|---|---|
| 20 September | Introduction, Formal Languages I | ||
| 27 September | Formal Languages II | ||
| 4 October | Automata Theory I | ||
| 11 October | Automata Theory II | Exercise 1 | |
| 18 October | Logic I | ||
| 25 October | Logic II | Exercise 2 | |
| 1 November | Cellular automata | ||
| 8 November | Dynamical systems / Markov models / Hidden Markov models | Exercise 3 | |
| 15 November | Fuzzy logic and other kinds of logics | ||
| 22 November | Fractals / Reservoir computing | ||
| 29 November | Graphs & Networks I | Exercise 4 | |
| 6 December | Graphs & Networks II | ||
| 13 December | Morphological computation / Alternative models of computation | Exercise 5 | |
| 20 December | Wrap-up / Final discussion |
The following list contains corrections for errors that where discovered in the lecture script. If you encounter additional errors, please send an e-mail to Tobias.
| Page 3-16 | In example 3.7, there is a semicolon (;) missing after the number rule. |
| Page 4-3 | In formula for the elements of the transition matrix the indices for column and row are switched. The correct formula should read pij = P(Xn = i | Xn-1 = j) instead of pij = P(Xn = j | Xn-1 = i). |
| Page 4-11 | The numbers for (R,S) and (S,S) in the lower right box are wrong. The correct values are (R,S) 0.0063 and (S,S) 0.0648. |
| Page 8-16 | The entries for the commands + and - are switched in Table 8.1. The correct actions are: + turn left and - turn right |
| Page 9-7 | The formula for the maximum number of edges mmax should read mmax = n(n-1) for a directed graph (a), and mmax = ½ n(n-1) for an undirected graph (b). |
The complete set of lecture slides will be uploaded in the course of the semester.
All books are available as Handapparat in the IFI library. Look for "Prof. Pfeifer Handapparat". Study the books in the library or copy the relevant parts.
Links and additional information to the demos shown in class will be published here.
