Martínez Alonso, Juan CarlosMilesi Vidal, Alex2020-02-202020-02-202019-06-20https://hdl.handle.net/2445/150797Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019 Director: Juan Carlos Martínez Alonso[en] This paper aims to approach automata theory which is the study of abstract computing devices. In the first part we are going to study regular languages and finite automatas, the devices that allow to recognize regular languages. In the last part we’ll see context-free languages and the machines to recognize them, the pushdown automatas.46 p.application/pdfspacc-by-nc-nd (c) Alex Milesi Vidal, 2019http://creativecommons.org/licenses/by-nc-nd/3.0/es/Teoria de màquinesTreballs de fi de grauLlenguatges formalsTeoria de la computacióTeoria de la codificacióMachine theoryBachelor's thesesFormal languagesTheory of computationCoding theoryinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess