4 ms·
> Regular expressions are equivalent to finite automata... That's not very powerful. True. I was using the (incorrect) terminology of the article, wherein "re
by cperciva 19y ago
> Regular expressions are equivalent to finite automata... That's not very powerful.
True. I was using the (incorrect) terminology of the article, wherein "regular expression" really means "irregular expression". Regular expressions are fine and can be matched quickly; throw in backreferences and you have a tool which is both very powerful (and can detect primes) and can be exceedingly slow.
- eru 19y agoI wonder if those 'irregular expressions' are already lambda isomorph (or say Turing complete if you like).