Ricerca di contatti, progetti,
corsi e pubblicazioni

Automata & Formal Languages

Descrizione

COURSE OBJECTIVES

The theory of automata and formal languages deals with the problem of modeling computation: what is a computer, and what are its fundamental capabilities? Thus, it constitutes the basis for further studies on the theory of computability and complexity. Additionally, Automata and Formal Languages is a very practical course, as it provides knowledge of the models used in many branches of computer science, from scanners and lexical analyzers in compilers, to programs for designing digital circuits, and even in other areas such as linguistics. At the end of this course you will be familiar with models of computations used today, you will understand how they are fundamental to further studies and you will be ready for a more advanced course on the theory of computation.

 

COURSE DESCRIPTION

Regular Languages (Finite Automata, Non Deterministic Finite Automata, Regular Expressions, Pumping Lemma for regular languages) and Context Free Languages (Context -Free Grammars and Push Down Automata) LEARNING METHODS Lessons, Assignments, Exams.

 

EXAMINATION INFORMATION
Midterm Exam and Final exam. Assignments will also be given.

 

REFERENCES

  • Introduction to the Theory of Computation, Michael Sipser.

Persone

 

Pozzi L.

Docente titolare del corso

Bhatt B. N.

Assistente

Informazioni aggiuntive

Semestre
Autunnale
Anno accademico
2020-2021
ECTS
3
Lingua
Inglese
Offerta formativa
Bachelor of Science in Informatics, Corso di base, Corso, 2° anno