Algorithm to Generate DFA for AND-operator in Regular Expression

Mirzakhmet B Syzdykov

2015

Full text Open access: Hybrid Metadata (CSL-JSON)

DOI 10.5120/ijca2015905557

Data confidence 70 medium

How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

For the past time a number of algorithms were presented to produce a deterministic finite automaton (DFA) for the regular expression.These algorithms could be divided into what they used as an initial data from which to produce DFA.The method to produce DFA from non-deterministic finite automaton (NFA) by a subset construction could be generalized for extended regular expressions, including intersection, negation and subtraction of the regular languages.In this article the modified algorithm of subset construction is presented; this algorithm produces a unigram DFA for the regular expression with extensions (specifically AND-operator).