Abstract

In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like "overriding" of the source NFA (NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator(or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown.