On 3/23/07, Fredrik Lundh <[EMAIL PROTECTED]> wrote:
> Bartlomiej Wolowiec wrote:
>
> > For some time I'm interested in regular expressions and Finite State
> > Machine.
> > Recently, I saw that Python uses "Secret Labs' Regular Expression Engine",
> > which very often works too slow. Its pesymist
Bartlomiej Wolowiec wrote:
> For some time I'm interested in regular expressions and Finite State Machine.
> Recently, I saw that Python uses "Secret Labs' Regular Expression Engine",
> which very often works too slow. Its pesymistic time complexity is O(2^n),
> although other solutions, with time
Bart³omiej Wo³owiec <[EMAIL PROTECTED]> wrote:
>
> For some time I'm interested in regular expressions and Finite State Machine.
> Recently, I saw that Python uses "Secret Labs' Regular Expression Engine",
> which very often works too slow. Its pesymistic time complexity is O(2^n),
> although
For some time I'm interested in regular expressions and Finite State Machine.
Recently, I saw that Python uses "Secret Labs' Regular Expression Engine",
which very often works too slow. Its pesymistic time complexity is O(2^n),
although other solutions, with time complexity O(n*m) ( O(n*m^2), m
