sic course on Automata Theory and Formal Languages aimed at students of the Computer Science Degree . The common competences of the course to Computer Science are:

- Knowledge and application of basic algorithms and procedures of Computer Science to design solutions to problems, and analyze the suitability and complexity of the proposed algorithms.
- Knowledge and application of basic techniques and principles of intelligent systems and their practical application.

**OBJETIVES: KNOWLEDGE AND SKILLS**

The main cognitive objectives and competences of the course are:

- Understand the theories to describe formal languages.
- Understand the concept of formal grammar and their types, as well as the type of language.
- Understand the concept of finite automaton as a regular language recognizer.
- Understand the concept of regular expression as a description of a regular language.
- Understand the concept of a pushdown automata to recognize any context-free language
- Understand the relation between grammars, languages and recognizers.
- Understand the principles and operation of a Turing Machine and its different types.
- Understand the concept of computational complexity.
- To know the methods to calculate the computational complexity.
- Understand the concept of P and NP complexity classes.
- Understand the limits of computation.

sic course on Automata Theory and Formal Languages aimed at students of the Computer Science Degree . The common competences of the course to Computer Science are:

- Knowledge and application of basic algorithms and procedures of Computer Science to design solutions to problems, and analyze the suitability and complexity of the proposed algorithms.
- Knowledge and application of basic techniques and principles of intelligent systems and their practical application.

**OBJETIVES: KNOWLEDGE AND SKILLS**

The main cognitive objectives and competences of the course are:

- Understand the theories to describe formal languages.
- Understand the concept of formal grammar and their types, as well as the type of language.
- Understand the concept of finite automaton as a regular language recognizer.
- Understand the concept of regular expression as a description of a regular language.
- Understand the concept of a pushdown automata to recognize any context-free language
- Understand the relation between grammars, languages and recognizers.
- Understand the principles and operation of a Turing Machine and its different types.
- Understand the concept of computational complexity.
- To know the methods to calculate the computational complexity.
- Understand the concept of P and NP complexity classes.
- Understand the limits of computation.

Basic course on Automata Theory and Formal Languages aimed at students of the Computer Science Degree . The common competences of the course to Computer Science are:

- Knowledge and application of basic algorithms and procedures of Computer Science to design solutions to problems, and analyze the suitability and complexity of the proposed algorithms.
- Knowledge and application of basic techniques and principles of intelligent systems and their practical application.

**OBJETIVES: KNOWLEDGE AND SKILLS**

The main cognitive objectives and competences of the course are:

- Understand the theories to describe formal languages.
- Understand the concept of formal grammar and their types, as well as the type of language.
- Understand the concept of finite automaton as a regular language recognizer.
- Understand the concept of regular expression as a description of a regular language.
- Understand the concept of a pushdown automata to recognize any context-free language
- Understand the relation between grammars, languages and recognizers.
- Understand the principles and operation of a Turing Machine and its different types.
- Understand the concept of computational complexity.
- To know the methods to calculate the computational complexity.
- Understand the concept of P and NP complexity classes.
- Understand the limits of computation.