Re: Regexes, Canonical Equivalence and Backtracking of Input

From: Eli Zaretskii <eliz_at_gnu.org>
Date: Mon, 18 May 2015 22:40:21 +0300

> Date: Mon, 18 May 2015 19:35:45 +0100
> From: Richard Wordingham <richard.wordingham_at_ntlworld.com>
>
> Mark Davis has published an algorithm to generate all strings
> canonically equivalent to a Unicode string

Where can I find the description of that algorithm?
Received on Mon May 18 2015 - 14:41:32 CDT

This message: [ Message body ]
Next message: Doug Ewell: "RE: Flag tags with U+1F3F3 and subtypes"
Previous message: Richard Wordingham: "Re: Flag tags with U+1F3F3 and subtypes"
In reply to: Richard Wordingham: "Regexes, Canonical Equivalence and Backtracking of Input"
Next in thread: Richard Wordingham: "Re: Regexes, Canonical Equivalence and Backtracking of Input"
Reply: Richard Wordingham: "Re: Regexes, Canonical Equivalence and Backtracking of Input"

Mail actions: [ respond to this message ] [ mail a new topic ]
Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

This archive was generated by hypermail 2.2.0 : Mon May 18 2015 - 14:41:32 CDT