Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/150797
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorMartínez Alonso, Juan Carlos-
dc.contributor.authorMilesi Vidal, Alex-
dc.date.accessioned2020-02-20T07:45:09Z-
dc.date.available2020-02-20T07:45:09Z-
dc.date.issued2019-06-20-
dc.identifier.urihttp://hdl.handle.net/2445/150797-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019 Director: Juan Carlos Martínez Alonsoca
dc.description.abstract[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.ca
dc.format.extent46 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isospaca
dc.rightscc-by-nc-nd (c) Alex Milesi Vidal, 2019-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques-
dc.subject.classificationTeoria de màquinesca
dc.subject.classificationTreballs de fi de grau-
dc.subject.classificationLlenguatges formalsca
dc.subject.classificationTeoria de la computacióca
dc.subject.classificationTeoria de la codificacióca
dc.subject.otherMachine theoryen
dc.subject.otherBachelor's theses-
dc.subject.otherFormal languagesen
dc.subject.otherTheory of computationen
dc.subject.otherCoding theoryen
dc.titleTeorı́a de autómatasca
dc.typeinfo:eu-repo/semantics/bachelorThesisca
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
150797.pdfMemòria505.56 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons