First cycle
degree courses
Second cycle
degree courses
Single cycle
degree courses
School of Science
COMPUTER SCIENCE
Course unit
AUTOMATA AND FORMAL LANGUAGES
SC03100756, A.A. 2017/18

Information concerning the students who enrolled in A.Y. 2016/17

Information on the course unit
Degree course First cycle degree in
COMPUTER SCIENCE
SC1167, Degree course structure A.Y. 2011/12, A.Y. 2017/18
N0
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 http://informatica.scienze.unipd.it/2017/laurea
Department of reference Department of Mathematics
Mandatory attendance No
Language of instruction Italian
Branch PADOVA
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

Lecturers
Teacher in charge GILBERTO FILE' INF/01
Other lecturers DAVIDE BRESOLIN INF/01

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

Mode of delivery (when and how)
Period Second semester
Year 2nd Year
Teaching method frontal

Organisation of didactics
Type of hours Credits Hours of
teaching
Hours of
Individual study
Shifts
Practice 2.0 16 34.0 No turn
Lecture 6.0 48 102.0 No turn

Calendar
Start of activities 26/02/2018
End of activities 01/06/2018

Syllabus
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 and oral examination.
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
-- lexical analysis

Part 2: context-free languages and syntactic analysis (3 cfu)
-- context-free grammars and languages
-- pushdown automata
-- syntactic analysis: top-down (LL) and bottom-up (LR) parsers

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: The slides used during the lectures are available to the students.
Textbooks (and optional supplementary readings)
  • Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D., Automi, linguaggi e calcolabilità. Milano: Addison-Wesley Pearson Education Italia, 2003. Cerca nel catalogo
  • Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers: Principles, Techniques, and Tools. --: Addison-Wesley, 2006. Cerca nel catalogo