You need to activate javascript for this site.
Menu Conteúdo Rodapé
  1. Home
  2. Courses
  3. Computer Science and Engineering
  4. Theory of Computing

Theory of Computing

Code 14343
Year 3
Semester S1
ECTS Credits 6
Workload PL(30H)/T(30H)
Scientific area Informatics
Entry requirements NA
Mode of delivery face-to-face
Work placements Not applicable.
Learning outcomes Understand the computing capacity of classical machines, as well as their theoretical limits.
Understand how classical computers handle problems.
Understand the fundamental concepts that support the languages of a classical computer.
Syllabus A. Introduction and Basic Concepts
B. Finite Automata
C. Regular Expressions and Languages
D. Pushdown automata
E. Turing machines
F. Incomputability and undecidability
G. Alternative Computing Models
H. Introduction to Computational Complexity
I. Programming in Models of Computation (practical-laboratory classes)
Main Bibliography Michael Sipser. Introducton to the Theory of Computation (3rd Edition). Cengage Learning, 2012.
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison Wesley, 2006.
Language Portuguese. Tutorial support is available in English.
Last updated on: 2024-09-18

The cookies used in this website do not collect personal information that helps to identify you. By continuing you agree to the cookie policy.