On Equivalence of Tractable and Non-polynomial Classes of Complexity

Abstract

In this preamble we give the full diversification towards our methods applied to the universality of nondeterministic finite automatons with respect to the question of equivalence of complexity classes like tractable, or polynomial, and non-tractable, or non-polynomial-the study goes deep into what wasn't reconsidered before according to the pattern matching within extended operators like intersection, subtraction and complement: the latter gives the full power of our automaton construction and method of validation which, in turn, leads to the "Time hierarchy theorem" collapse