Usted está aquí: Inicio Ingeniería Informática Formal Languages and Automata Theory Material de clase

Material de clase

Acciones de Documento
  • Marcadores (bookmarks)
Autores: DAVID GRIOL BARRES, ARACELI SANCHIS DE MIGUEL, MARÍA PAZ SESMERO LORENTE, AGAPITO LEDEZMA ESPINO, JUAN MANUEL ALONSO WEBER
Carpeta contenedora de las transparencias de clase
Unit 1. Introduction to Automata Theory and Formal Languages
Introduction to Formal Languages and Automata Theory Why study Automata Theory. History and Origins Relationship with others Areas of Knowledge Machines, Languages and Algorithms.
Unit 2. Automata Theory
Automata Theory Introduction and Definitions. Mathematical model of an automaton Automatas and algorithms. Discrete, continuous, and hybrid automata. Classes of automata.
Unit 3. Finite Automata
Definition and Representation of Deterministic Finite Automata (DFA) DFA as Recognition Device Equivalence and Minimization of DFA Theorems of DFA Definition and Representation of Nondeterministic Finite Automata (NDFA) The Language of a NDFA Equivalence of DFA and NDFA
Unit 4. Languages and Formal Grammars
Operations with Words. Operations with Languages. Derivations. Concept of Grammar. Formal Grammar Chomsky Hierarchy and Equivalent Grammar Context-Free Grammar Language of a Context-Free Grammar. Parse Tree Well-Formed Grammar Chomsky Normal Form Greibach Normal Form
Unit 5. Regular Languages
Definition of Regular Languages DFA for a Regular Grammar Equivalence of Regular Expressions Kleene's Theorem Characteristic equations Synthesis Problem: Recursive Algorithm Derivatives of Regular Expressions
Unit 6. Push-Down Automata
Definition of Pushdown Automata (PDA). Transitions, Movement and Instantaneous Description in PDA. Acceptance by Empty Stack. Acceptance by Final State. Language Accepted by a PDA. Equivalence of PDA by Empty Stack and PDA by Final State. From Context-Free Grammar to Push-Down Automata. From Pushdown Automata to Context-Free Grammar.
Unit 7. Turing Machine
Definition if Turing Machine. Variations of Turing Machine. Universal Turing Machine.
Unit 8. Computational Complexity
Complexity Theory Complexity of algorithms P versus NP problems Defining complexity classes Time complexity Hierarchy theorems Non-computational problems Limits of Computability
Unit 6. Push-Down Automata. Main guide to follow the unit
Main Guide to follow Unit 6.
Unit 7. Turing Machines. Main guide to follow the unit
Main Guide to follow Unit 7.
Unit 8. Computational Complexity. Main guide to follow the unit
Main Guide to follow Unit 8.
Unit 1. Introduction to Automata Theory and Formal Languages. Main guide to follow the unit
Main Guide to follow Unit 1.
Unit 2. Automata Theory. Main guide to follow the unit
Main Guide to follow Unit 2.
Unit 3. Finite Automata. Main guide to follow the unit
Main Guide to follow Unit 3.
Unit 4. Languages and Formal Grammars. Main guide to follow the unit
Main Guide to follow Unit 4.
Unit 5. Regular Languages. Main guide to follow the unit
Main Guide to follow Unit 5.
Reutilizar Curso
Descargar este curso