Resumen:
0. Introduction -- Part 1: Automata and languages -- 1. Regular languages -- 2. Context-free languages -- Part 2: Computability theory -- 3. The Church-Turing thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced topics in computability theory -- Part 3: Complexity theory -- 7. Time complexity -- 8. Space complexity -- 9. Intractability -- 10. Advanced topics in complexity theory.