The teaching presents concepts and results of Automata Theory and of Computability Theory of fundamental importance in the cultural background of a computer scientist.
To understand key concepts of Theory of Automata and Theory of Computability, such as expressive power of automata, and decidability and semi-decidability of problems.
At the end of the teaching the student/student will be able to:
Traditional.
Automata and Languages Alphabets, strings, languages Deterministic (DFA) and non deterministic (NFA) finite state automata DFA minimization, regular expressions Closure properties of regular languages, pumping lemma Context-free grammars, deterministic and non deterministic push down automata (PDA) Closure properties of context-free languages, pumping lemma
Computability Turing machines, accepted languages Indecidability, recursive and recursively enumerable languages, universal language and machine, indecidability of the universal language Halting problem Indecidable problems on Turing machines, Rice theorem, Church thesis
Course notes.
Ricevimento: Reception through appointment via mail.
Ricevimento: By appointment via email
FRANCESCO DAGNINO (President)
ARNAUD HENRI PAUL SANGNIER (President)
According to the calendar approved by the Degree Program Board:https://corsi.unige.it/en/corsi/8759/studenti-orario
The examination consists of a written test and an oral test.In order to take the oral test,it is necessary to have passed the written test.
Guidelines for students with certified Specific Learning Disorders, disabilities, or other special educational needs are available at https://corsi.unige.it/en/corsi/8759/studenti-disabilita-dsa
The written test verifies the student's ability to put into practice the concepts seen in class. The oral test verifies the understanding of the concepts and the ability to illustrate them in appropriate way.
For further information, please refer to the course’s AulaWeb module or contact the instructor.