References

[1]

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, first edition, 307 p. 52 illus. edition, 2011.

[2]

A. ‍Arnold and I. ‍Guessarian. Mathematics for Computer Science. Prentice-Hall, 1996.

[3]

Olivier Carton. Langages formels, Calculabilité et Complexité. Vuibert Ed., June 2014.

[4]

E. ‍Chailloux, P. ‍Manoury, and B. ‍Pagano. Developing applications with objective caml. http://caml.inria.fr/oreilly-book, 2003.

[5]

Chris Hankin. Lambda Calculi: A Guide for Computer Scientists, volume ‍3 of Graduate Texts in Computer Science. Clarendon Press, Oxford, 1994.

[6]

Jason Hickey, Anil Madhavapeddy, and Yaron Minsky. Real World OCaml. O’Reilly, 2014.

[7]

J.E. Hopcroft, R. ‍Motwani, and J.D. Ullman. Introduction to automata theory, languages, and computation. Pearson education, third edition, 560 pages. edition, 2006.

[8]

Dexter Kozen. Automata and Computability. Springer-Verlag, New York, 1997.

[9]

Dexter Kozen. Theory of Computation. Springer, New York, 2006.

[10]

Harry ‍R. Lewis and Christos ‍H. Papadimitriou. Elements of the Theory of Computation. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1997.

[11]

P. ‍Linz. An introduction to formal languages and automata. Jones and Bartlett Publisher, 2006.

[12]

M. ‍Sipser. Introducton to the Theory of Computation. PWS Publishing, 2006.

Enviar comentários e dúvidas para (retire os UUU) : desousaUUU@UUUdi.ubi.pt