Deterministic automata for extended regular expressions

What is it about?

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 of the MINUS-operator (and complement) is shown

Featured Image

Why is it important?

The third part of the scientific work