Computational Models

Code:

CC1004

Acronym:

CC1004

Level:

100

Keywords
Classification	Keyword
OFICIAL	Computer Science

Instance: 2024/2025 - 2S

Active?	Yes
Web Page:	http://www.dcc.fc.up.pt/~rvr/aulas/AC2425/MC2324/
Responsible unit:	Department of Computer Science
Course/CS Responsible:	Bachelor in Computer Science

Cycles of Study/Courses

Acronym	No. of Students	Study Plan	Curricular Years	Credits UCN	Credits ECTS	Contact hours	Total Time
L:B	0	Official Study Plan	3	-	6	48	162
L:BIOINF	0	Official Study Plan	3	-	6	48	162
L:CC	137	study plan from 2021/22	1	-	6	48	162
L:F	0	Official Study Plan	2	-	6	48	162
			3
L:G	0	study plan from 2017/18	2	-	6	48	162
			3
L:IACD	115	study plan from 2021/22	1	-	6	48	162
L:M	16	Official Study Plan	2	-	6	48	162
			3
L:MA	8	Official Study Plan	3	-	6	48	162
L:Q	1	study plan from 2016/17	3	-	6	48	162

Teaching language

Portuguese

Objectives

Teach fundamental concepts and results about three computational models (finite automata, pushdown automata, Turing machines) and the related classes of formal languages, with emphasis on regular and context free languages.

Learning outcomes and competences

Students are expected to be able to describe simple formal languages using different models of computation and classify them in the Chomsky hierarchy.

Working method

Presencial

Program

Notion of formal language. Deterministic finite automata and non-deterministic finite automata. Regular expressions and finite automata. Properties of regular languages. Minimization of finite automata. Pumping lemma for regular languages. Context-free grammars and languages. Derivation trees. Ambiguity. Simplification of context-free grammars and normal forms. Push-down automata. Properties of context-free languages. Pumping lemma for context-free grammars. Turing machines and notion of computability.

Mandatory literature

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman; Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 2006. ISBN: 0-321-47617-4
Dexter C. Kozen; Automata and Computability, Sringer, 1997. ISBN: ISBN 0-387-94907-0

Teaching methods and learning activities

Lectures: exposition of  the syllabus topics and examples.
Practical Lectures: exercise solving and discussion.

Evaluation Type

Distributed evaluation without final exam

Assessment Components

designation	Weight (%)
Teste	100,00
Total:	100,00

Amount of time allocated to each course unit

designation	Time (hours)
Estudo autónomo	114,00
Frequência das aulas	48,00
Total:	162,00

Eligibility for exams

Students must attend at least 3/4 of the pratical classes to be admitted to the exams.

Calculation formula of final grade

The final mark corresponds to the classification obtained
- as average grade of the tests to be realized during the semester and at the date of the first exam (each with a classification of at least 6 out of 20 points);
- or the grade of the second exam (época de recurso).

Classification improvement

Final exam (