on an interesting hypothesis of the theory of formal languages

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.