Length : 15 hours - 3 cfu
Abstract
Descriptional complexity is an area of computer science that studies and compares formal systems with respect to the succinctness of their descriptions.
Some fundamental results in this field will be presented, by mainly considering regular languages and finite automata (in the deterministic, nondeterministic, one-way, two-way variants).
Some descriptional complexity questions and results related to other classes of languages and machines will be also presented.
Requirements: Basic knowledge in automata and formal language theory.
| Giorni | Aula | Orario |
| 22/01/2019 | Meeting Room 3rd floor - Via Celoria 18 - 20133 Milano | 09:30-12:30 |
| 24/01/2019 | Meeting Room 3rd floor - Via Celoria 18 - 20133 Milano |
09:30-12:30 |
| 05/02/2019 | Meeting Room 3rd floor - Via Celoria 18 - 20133 Milano | 09:30-12:30 |
| 07/02/2019 | Meeting Room 3rd floor - Via Celoria 18 - 20133 Milano | 09:30-12:30 |
| 08/02/2019 | Meeting Room 3rd floor - Via Celoria 18 - 20133 Milano | 09:30-12:30 |
Lecturer
Prof. Giovanni Pighizzini
Assessor
Prof. Giovanni Pighizzini