Formal language theory studies mathematical models of syntax. Languages, whether natural or artificial, are defined by formal grammars, which define the structure of syntactically correct sentences. Then a parsing algorithm parses a sentence in a language according to its grammar. The course presents mathematical foundations of formal grammars, with a particular emphasis on parsing algorithms and their computational complexity.
| Date and time | Class|Name | Venue|short | Materials |
|---|---|---|---|
| 10 October 17:20–18:55 |
Лекция 1, Lecture | ПОМИ РАН | No |
| 10 October 19:05–20:40 |
Лекция 2, Lecture | ПОМИ РАН | No |
| 11 October 11:15–12:50 |
Лекция 3, Lecture | ПОМИ РАН | No |
| 11 October 13:00–14:35 |
Лекция 4, Lecture | ПОМИ РАН | No |
| 11 October 15:35–17:05 |
Лекция 5, Lecture | ПОМИ РАН | No |
| 17 October 17:20–18:50 |
Лекция 6, Lecture | ПОМИ РАН | No |
| 17 October 19:05–20:35 |
Лекция 7, Lecture | ПОМИ РАН | No |
| 18 October 11:15–12:45 |
Лекция 8, Lecture | ПОМИ РАН | No |
| 18 October 13:00–14:30 |
Лекция 9, Lecture | ПОМИ РАН | No |
| 18 October 15:35–17:05 |
Лекция 10, Lecture | ПОМИ РАН | No |
