Cardinality estimates for some classes of regular languages
Dmitriy E. Alexandrov · Discrete Mathematics and Applications · 2015
Abstract We consider a method that modifies regular expressions in order to solve the “exponential explosion” problem on the number of states of the finite automaton that recognizes a set of regular languages defined by the union of regular expressions of the form .∗ R