On promise problems and a great automata diversity

Ocampo Gamboa, Juan Pablo; Nieto Chávez, Iván Gustavo

On promise problems and a great automata diversity

dc.contributor.advisor	Mejía Moreno, Carolina	spa
dc.contributor.author	Ocampo Gamboa, Juan Pablo	spa
dc.contributor.author	Nieto Chávez, Iván Gustavo	spa
dc.date.accessioned	2022-04-20T15:05:27Z
dc.date.available	2022-04-20T15:05:27Z
dc.date.created	2022-02-28	spa
dc.description	Along this paper, we give the basic concepts on automata theory and we introduce the way to accept or reject promise problems and decision problems, the last one through the notions of recognizability and solvability. Afterwards, we show some results concerning promise problems, oneof these is the fact that we can find an automaton recognized exactly by measure-once one-way quantum finite automata, but no deterministic automata can recognize it. Finally, we focus in some of the applications of promise problems and how these can be useful in different topics of computer science and complexity theory.	spa
dc.description.abstract	The concept of promise problems was introduced and initially explored by Even, Selman, Yacobi, Goldreich, and other scholars in the 80's. The promise problems can be seen as a generalization of the decision problems and such problems are even more fundamental than formal language and decision problems because they are used on the most basic concepts for complexity theory and some applications like cryptography.	spa
dc.format.mimetype	pdf	spa
dc.identifier.uri	http://hdl.handle.net/11349/28864
dc.language.iso	spa	spa
dc.rights	Atribución-NoComercial-SinDerivadas 4.0 Internacional	*
dc.rights.acceso	Abierto (Texto Completo)	spa
dc.rights.accessrights	info:eu-repo/semantics/openAccess	spa
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	Autómatas clásicos	spa
dc.subject	Autómatas cuánticos	spa
dc.subject	Problemas de promesa	spa
dc.subject	Complejidad	spa
dc.subject	Criptografía	spa
dc.subject.keyword	Classic automata	spa
dc.subject.keyword	Quantum automata	spa
dc.subject.keyword	Promise problems	spa
dc.subject.keyword	Complexity	spa
dc.subject.keyword	Cryptography	spa
dc.subject.lemb	Matemáticas - Tesis y disertaciones académicas	spa
dc.subject.lemb	Criptografía	spa
dc.subject.lemb	Teoría de las máquinas	spa
dc.subject.lemb	Lingüística matemática	spa
dc.subject.lemb	Notación matemática	spa
dc.title	On promise problems and a great automata diversity	spa
dc.title.titleenglish	Sobre problemas de promesa y una gran diversidad de autómatas	spa
dc.type.coar	http://purl.org/coar/resource_type/c_7a1f	spa
dc.type.degree	Monografía	spa
dc.type.driver	info:eu-repo/semantics/bachelorThesis	spa