Regular Expressions, au point

Details Regular Expressions, au point Regular Expressions, au point

2010-10-13

arxiv.org/abs/1010.2604v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Regular Expressions, au point does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Regular Expressions, au point, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular Expressions, au point will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226297