Shahid Rajaee Teacher Training University Journal of Discrete Mathematics and Its Applications 2981-0809 9 2 2024 06 01 On an interesting hypothesis of the theory of formal languages 81 102 2154 10.22061/jdma.2024.10789.1069 EN Boris Melnikov Shenzhen MSU-BIT University, China Journal Article 2024 04 17 The formulation of a hypothesis for any pair of nonempty finite languages is considered. The hypothesis consists in the formulation of the necessary conditions for the equality of infinite iterations of these languages, the paper provides some equivalent versions of this hypothesis. When fulfilling this hypothesis, we show the possibility of verifying the equality of infinite iterations of these languages in polynomial time. On the other hand, we present a plan for reducing the verification of the same equality to checking the completeness of the language of a specially constructed nondeterministic finite automaton, and such a check cannot be carried out in polynomial time. In this regard, the possibility of reducing the equality P=NP to the special hypothesis of the theory of formal languages is formulated. https://jdma.sru.ac.ir/article_2154_549ec79d95e8acb46908f1ef747bb707.pdf