Regular Expressions, au point
Formal Languages and Automata Theory
2010-10-14 v1
Abstract
We introduce a new technique for constructing a finite state deterministic automaton from a regular expression, based on the idea of marking a suitable set of positions inside the expression, intuitively representing the possible points reached after the processing of an initial prefix of the input string. Pointed regular expressions join the elegance and the symbolic appealingness of Brzozowski's derivatives, with the effectiveness of McNaughton and Yamada's labelling technique, essentially combining the best of the two approaches.
Keywords
Cite
@article{arxiv.1010.2604,
title = {Regular Expressions, au point},
author = {Andrea Asperti and Claudio Sacerdoti Coen and Enrico Tassi},
journal= {arXiv preprint arXiv:1010.2604},
year = {2010}
}