Mejía Moreno, CarolinaOcampo Gamboa, Juan PabloNieto Chávez, Iván Gustavo2022-04-202022-04-202022-02-28http://hdl.handle.net/11349/28864Along 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.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.pdfspaAtribución-NoComercial-SinDerivadas 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Autómatas clásicosAutómatas cuánticosProblemas de promesaComplejidadCriptografíaMatemáticas - Tesis y disertaciones académicasCriptografíaTeoría de las máquinasLingüística matemáticaNotación matemáticainfo:eu-repo/semantics/openAccessClassic automataQuantum automataPromise problemsComplexityCryptographyMonografíaAbierto (Texto Completo)