An Effective Algorithm for the Membership Problem for Extended Regular Expressions

@inproceedings{Rosu2007AnEA,
  title={An Effective Algorithm for the Membership Problem for Extended Regular Expressions},
  author={Grigore Rosu},
  booktitle={FoSSaCS},
  year={2007}
}
By adding the complement operator (¬), extended regular expressions (ERE ) can encode regular languages non-elementarily more succinctly than regular expressions. The ERE membership problem asks whether a word w of size n belongs to the language of an ERE R of size m. Unfortunately, the best known membership algorithms are either non-elementary in m or… CONTINUE READING