First cycle
degree courses
Second cycle
degree courses
Single cycle
degree courses
School of Science
Course unit
SC03100756, A.A. 2019/20

Information concerning the students who enrolled in A.Y. 2018/19

Information on the course unit
Degree course First cycle degree in
SC1167, Degree course structure A.Y. 2011/12, A.Y. 2019/20
bring this page
with you
Number of ECTS credits allocated 8.0
Type of assessment Mark
Course unit English denomination AUTOMATA AND FORMAL LANGUAGES
Website of the academic structure
Department of reference Department of Mathematics
Mandatory attendance No
Language of instruction Italian
Single Course unit The Course unit can be attended under the option Single Course unit attendance
Optional Course unit The Course unit can be chosen as Optional Course unit

No lecturer assigned to this course unit

ECTS: details
Type Scientific-Disciplinary Sector Credits allocated
Core courses INF/01 Computer Science 8.0

Course unit organization
Period Second semester
Year 2nd Year
Teaching method frontal

Type of hours Credits Teaching
Hours of
Individual study
Practice 2.0 16 34.0 No turn
Lecture 6.0 48 102.0 No turn

Start of activities 02/03/2020
End of activities 12/06/2020
Show course schedule 2019/20 Reg.2011 course timetable

Prerequisites: Basic notions of logic.
Target skills and knowledge: This course provides the fundamental concepts of automata theory and formal languages, showing their application to compilers. Moreover, it introduces the notions of indecidability and intractability.
Examination methods: Written exam.
Assessment criteria: The written examination contains questions that allow to evaluate the level of comprehension of the notions taught during the course. There are also exercises about automata and formal grammars.
Course unit contents: The main topics of the course are:

Part 1: regular languages and lexical analysis (3 cfu)
-- finite state automata
-- regular expressions and regular languages
-- pumping lemma
-- properties of regular languages
-- lexical analysis

Part 2: context-free languages and syntactic analysis (3 cfu)
-- context-free grammars and languages
-- pushdown automata
-- pumping lemma
-- properties of context-free languages
-- syntactic analysis

Part 3: undecidability and intractability (2 cfu)
-- Turing machines
-- indecidability
-- intractable problems
-- classes P and NP
Planned learning activities and teaching methods: Lectures and exercises in classroom.
Additional notes about suggested reading: A moodle platform contains all material of the course. The lessons are recorded and available to students.
Textbooks (and optional supplementary readings)
  • Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers: Principles, Techniques, and Tools. --: Addison-Wesley, 2006. Cerca nel catalogo
  • Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D., Automi, linguaggi e calcolabilità. Milano: Addison-Wesley Pearson Italia, 2009. Cerca nel catalogo