|
Main Bibliography |
J.B. Almeida, M.J. Frade, J.S. Pinto, and S. ?Melo ?de Sousa. Rigorous Software Development, An Introduction to Program Verification, volume 103 of Undergraduate Topics in Computer Science. Springer-Verlag, 2011.
A. ?Arnold, I. ?Guessarian. Mathematics for Computer Science. Prentice-Hall, 1996.
Chris Hankin. Lambda Calculi: A Guide for Computer Scientists, volume ?3 of Graduate Texts in Computer Science. Clarendon Press, Oxford, 1994.
J.E. Hopcroft, R. ?Motwani, and J.D. Ullman. Introduction to automata theory, languages, and computation. Pearson education, third edition, 2006.
Dexter Kozen. Automata and Computability. Springer-Verlag, New York, 1997.
Dexter Kozen. Theory of Computation. Springer, New York, 2006.
H. R. Lewis, Christos Papadimitriou lements of the Theory of Computation. Prentice Hal, NJ, USA, 1997.
P. ?Linz. An introduction to formal languages and automata. Jones and Bartlett Publisher, 2006.
M. ?Sipser. Introducton to the Theory of Computation. PWS Publishing, 2006.
|
|
Teaching Methodologies and Assessment Criteria |
In order for the student to acquire the required skills, the student is provided for:
- 2h/week of theoretical classes (ET) for oral exposure of theoretical concepts, methods and algorithms, also using writing on the board, discussing ideas with students, and projection of slides;
- 2h/week of practical-laboratory classes (PL), in which the student will apply and test the concepts, methods and algorithms presented in the theoretical classes, through the resolution of exercises that are included in forms created for this purpose;
|