Lazy Principle Outcome of the Proposed Algorithm

In this short communication, we are to address the notable outcome of our proposed algorithm for the extended regular expressions with intersection, subtraction and complement operators, our key finding inflicts such aspects known as lazy evaluation which can be framed to a local search technique, which is based upon the observation that we don’t need to build product automaton, rather we can strictly propose the automaton states which comply with the given constraints or rules of the stated problem – we will try to adjust this methodology accordingly