Re: Regexp notation

["Jesper Buus Nielsen" <buus@daimi.aau.dk>]

Fernando Pereira wrote:
[snip]
> algorithm). My experience building various text and speech-processing
> applications using full regular algebra is that the worst case can often
> be avoided, and that people often give up in advance intimidated by the
> worst case before they examine the problem closely enough to know whether
> it could be solved with the best current techniques, which are much more
> sophisticated than those in standard textbooks (even converting a regexp
> to a DFA can be done *much* better than what one can find in any textbook
> I know, and techniques such as failure functions or lazy automata
> algorithms are much less well-known than they deserve to be).

Could you start making them well-known by pointing me to some paper/book on
the subject. I'm about to implement a text-processing application and would
be glad for the refs.

/Jesper