Methodology to Produce Deterministic Automaton for Extended Operators in Regular Expression

What is it about?

Recent and past work for extended operators (AND, MINUS) in the regular expression was covered only by Berry-Sethi. However, the estimation of complexity wasn't given (in fact the method produces non-deterministic automaton, NFA). In this paper, the methods, known as "overriding", is presented for this task. This method uses semantic rules overriding the typical NFA to produce DFA (deterministic finite automaton)

Featured Image

Why is it important?

Newer than older