Editorial: P versus NP problem from Formal Languages Theory View

  • Jorge A. Ruiz-Vanoye Universidad Politécnica de Pachuca
  • Ocotlán Díaz-Parra Universidad Politécnica de Pachuca
  • Francisco Rafael Trejo-Macotela Universidad Politécnica de Pachuca
  • Julio Cesar Ramos-Fernández Universidad Politécnica de Pachuca
Keywords: P versus NP, NP-Hard

Abstract

P versus NP is an unsolved problem in mathematics and computational complexity. In this paper, we use the formal language theory to the computational complexity to analyze P versus NP problem from a new point of view. P versus NP problem is to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time. Then, we use the theory of formal languages to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time. We use different problems to display the question of P versus NP from Formal Languages Theory View.

Published
2020-12-14
How to Cite
Ruiz-Vanoye, J. A., Díaz-Parra, O., Trejo-Macotela, F. R., & Ramos-Fernández, J. C. (2020). Editorial: P versus NP problem from Formal Languages Theory View. International Journal of Combinatorial Optimization Problems and Informatics, 12(1), 1-8. Retrieved from https://ijcopi.org/ojs/article/view/207
Section
Articles

Most read articles by the same author(s)